Error-pruning in interface automata

DOI10.1007/978-3-319-04298-5_15MaRDI QIDQ2938099zbMATH OpenOpenAlexFDO

Authors Ferenc Bujtor, Walter Vogler

Publication date 13 January 2015

Published in SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04298-5_15

Mathematics Subject Classification ID

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

Recommendations

• Error-pruning in interface automata
• Fault-free refinements for interface automata
• A linear-time branching-time perspective on interface automata
• An algebraic theory of interface automata
• A generalised theory of interface automata, component compatibility and error

Cited in

(7)

• Moving from interface theories to assembly theories
• A generalised theory of interface automata, component compatibility and error
• Error-pruning in interface automata
• Nondeterministic modal interfaces
• A generalised theory of interface automata, component compatibility and error
• Fault-free refinements for interface automata
• Hypercontracts

This page was built for publication: Error-pruning in interface automata

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