Abstractions for transition systems with applications to stubborn sets

DOI10.1007/978-3-319-51046-0_6zbMATH Open1485.68160OpenAlexW2562654581MaRDI QIDQ1708713

Henri Hansen

Publication date: 26 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-51046-0_6

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

An approximation algorithm for box abstraction of transition systems on real state spaces

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Extensional equivalences for transition systems 👍 👎
• Well-abstracted transition systems: Application to FIFO automata. 👍 👎
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation 👍 👎
• A deductive approach towards reasoning about algebraic transition systems 👍 👎
• Toward an infinitary logic of domains: Abramsky logic for transition systems 👍 👎
• Ideal Abstractions for Well-Structured Transition Systems 👍 👎
• A coalgebraic presentation of structured transition systems 👍 👎

This page was built for publication: Abstractions for transition systems with applications to stubborn sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708713)