On Weak Modal Compatibility, Refinement, and the MIO Workbench

DOI10.1007/978-3-642-12002-2_15zbMath1284.68339OpenAlexW1564626116MaRDI QIDQ3557076

Andreas Schroeder, Philip Mayer, Sebastian S. Bauer, Rolf Hennicker

Publication date: 27 April 2010

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12002-2_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (23)

Building a Modal Interface Theory for Concurrency and Data ⋮ Nondeterministic modal interfaces ⋮ Stuttering for Abstract Probabilistic Automata ⋮ Extending modal transition systems with structured labels ⋮ ACTL for modal interface automata ⋮ Compatibility in a multi-component environment ⋮ A linear-time branching-time perspective on interface automata ⋮ A generalised theory of interface automata, component compatibility and error ⋮ Interface automata for shared memory ⋮ Can we communicate? Using dynamic logic to verify team automata ⋮ Modal Open Petri Nets ⋮ Stuttering for abstract probabilistic automata ⋮ A Modal Interface Theory with Data Constraints ⋮ EXPTIME-completeness of thorough refinement on modal transition systems ⋮ Assembly Theories for Communication-Safe Component Systems ⋮ Interface theories for concurrency and data ⋮ Connecting open systems of communicating finite state machines ⋮ Error-pruning in interface automata ⋮ A Generalised Theory of Interface Automata, Component Compatibility and Error ⋮ Unnamed Item ⋮ Modal Interface Theories for Communication-Safe Component Assemblies ⋮ Moving from interface theories to assembly theories ⋮ Richer interface automata with optimistic and pessimistic compatibility

Uses Software

• MIO Workbench

This page was built for publication: On Weak Modal Compatibility, Refinement, and the MIO Workbench