Richer interface automata with optimistic and pessimistic compatibility

DOI10.1007/S00236-014-0211-0MaRDI QIDQ2350491zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A generalised theory of interface automata, component compatibility and error
• A generalised theory of interface automata, component compatibility and error
• Fault-free refinements for interface automata
• Combining partial specifications using alternating interface automata
• An algebraic theory of interface automata
• Automated Technology for Verification and Analysis
• Interface automata with complex actions: limiting interleaving in interface automata
• Resolution-based approach to compatibility analysis of interacting automata

Cites work

• A compositional specification theory for component behaviours
• ACTL for modal interface automata
• Behavioral interface specification languages
• Component refinement and CSC-solving for STG decomposition
• Compositionality for quantitative specifications
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 2080757 (Why is no real title available?)
• Modal I/O Automata for Interface and Product Line Theories
• Modal interface automata
• Modal specification theories for component-based design
• Modal transition systems: composition and LTL model checking
• Nondeterministic modal interfaces
• On weak modal compatibility, refinement, and the MIO workbench

Cited in

(7)

• Moving from interface theories to assembly theories
• ACTL for modal interface automata
• A generalised theory of interface automata, component compatibility and error
• Nondeterministic modal interfaces
• A generalised theory of interface automata, component compatibility and error
• On weak modal compatibility, refinement, and the MIO workbench
• Can we communicate? Using dynamic logic to verify team automata

Describes a project that uses

Uses Software

• MIO Workbench

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

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