Error-pruning in interface automata
From MaRDI portal
Publication:2517232
DOI10.1016/j.tcs.2015.06.047zbMath1328.68136OpenAlexW2175723538MaRDI QIDQ2517232
Publication date: 17 August 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.047
concurrencyinterface automataparallel compositionfully abstract precongruenceoptimistic/pessimistic approach
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
A linear-time branching-time perspective on interface automata ⋮ Interface automata for shared memory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Modular construction and partial order semantics of Petri nets
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
- A Compositional Specification Theory for Component Behaviours
- On Weak Modal Compatibility, Refinement, and the MIO Workbench
- Deciding Substitutability of Services with Operating Guidelines
- A Theory of Communicating Sequential Processes
- Frontiers of Combining Systems
- Modal I/O Automata for Interface and Product Line Theories
- Modal Interface Automata
This page was built for publication: Error-pruning in interface automata