Error-pruning in interface automata

DOI10.1016/J.TCS.2015.06.047zbMATH Open1328.68136OpenAlexW2175723538MaRDI QIDQ2517232FDOQ2517232

Authors: Ferenc Bujtor, Walter Vogler 

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

Recommendations

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

zbMATH Keywords

concurrencyinterface automataparallel compositionfully abstract precongruenceoptimistic/pessimistic approach

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Theory of Communicating Sequential Processes
• Title not available (Why is that?)
• Modal I/O Automata for Interface and Product Line Theories
• On weak modal compatibility, refinement, and the MIO workbench
• A compositional specification theory for component behaviours
• Deciding Substitutability of Services with Operating Guidelines
• 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
• Frontiers of Combining Systems
• Modal interface automata

Cited In (4)

• Error-pruning in interface automata
• Fault-free refinements for interface automata
• A linear-time branching-time perspective on interface automata
• Interface automata for shared memory

Uses Software

• MIO Workbench

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