A process algebraic view of input/output automata

DOI10.1016/0304-3975(95)92307-JMaRDI QIDQ674195zbMATH OpenOpenAlexFDO

Authors Rocco De Nicola, Roberto Segala

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)

Recommendations

• CONCUR 2003 - Concurrency Theory
• Publication:3028334
• Specifying and verifying external behaviour of fair input/output automata by using the temporal logic of actions
• scientific article; zbMATH DE number 4110131
• Process algebra and model checking

Cites work

• scientific article; zbMATH DE number 3808928 (Why is no real title available?)
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• A calculus of total correctness for communicating processes
• Bisimulation can't be traced
• Extensional equivalences for transition systems
• Higher-level synchronising devices in Meije-SCCS
• Process Algebra
• Quiescence, fairness, testing, and the notion of implementation
• Receptive process theory

Cited in

(12)

• An algebraic theory of interface automata
• CONCUR 2003 - Concurrency Theory
• Dynamic input/output automata: a formal and compositional model for dynamic systems
• Synchronization expressions with extended join operation
• Relational concurrent refinement. III: Traces, partial relations and automata
• Methodologies for specification of real-time systems using timed I/O automata
• Relational concurrent refinement: automata
• Integrated Formal Methods
• Trace and testing equivalence on asynchronous processes
• Specification completion for IOCO
• Nondeterministic modal interfaces
• A calculus for team automata

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

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