A process algebraic view of input/output automata

DOI10.1016/0304-3975(95)92307-JzbMath0874.68209OpenAlexW1968150358MaRDI QIDQ674195

Roberto Segala, Rocco De Nicola

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)92307-j

zbMATH Keywords

concurrent algorithmsinput/output automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Nondeterministic modal interfaces ⋮ Dynamic input/output automata: a formal and compositional model for dynamic systems ⋮ An algebraic theory of interface automata ⋮ Relational Concurrent Refinement: Automata ⋮ Methodologies for Specification of Real-Time Systems Using Timed I/O Automata ⋮ Relational concurrent refinement. III: Traces, partial relations and automata ⋮ Synchronization expressions with extended join operation ⋮ Specification completion for IOCO ⋮ Trace and testing equivalence on asynchronous processes ⋮ A Calculus for Team Automata

Cites Work

• Receptive process theory
• Higher-level synchronising devices in Meije-SCCS
• Extensional equivalences for transition systems
• A calculus of total correctness for communicating processes
• Quiescence, fairness, testing, and the notion of implementation
• Process Algebra
• Bisimulation can't be traced
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A process algebraic view of input/output automata