Richer interface automata with optimistic and pessimistic compatibility

DOI10.1007/s00236-014-0211-0zbMath1325.68161OpenAlexW1966634263MaRDI QIDQ2350491

Gerald Lüttgen, Walter Vogler, Sascha Fendrich

Publication date: 24 June 2015

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-014-0211-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Nondeterministic modal interfaces ⋮ ACTL for modal interface automata ⋮ A generalised theory of interface automata, component compatibility and error ⋮ Can we communicate? Using dynamic logic to verify team automata ⋮ A Generalised Theory of Interface Automata, Component Compatibility and Error ⋮ Moving from interface theories to assembly theories

Uses Software

• MIO Workbench

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositionality for quantitative specifications
• ACTL for modal interface automata
• Component refinement and CSC-solving for STG decomposition
• Behavioral interface specification languages
• A Compositional Specification Theory for Component Behaviours
• Modal Transition Systems: Composition and LTL Model Checking
• On Weak Modal Compatibility, Refinement, and the MIO Workbench
• Nondeterministic Modal Interfaces
• Modal I/O Automata for Interface and Product Line Theories
• Modal Interface Automata

This page was built for publication: Richer interface automata with optimistic and pessimistic compatibility