A Calculus for Team Automata

DOI10.1016/J.ENTCS.2007.08.022zbMath1279.68274OpenAlexW2163567867MaRDI QIDQ2873606

Dirk Janssens, Maurice H. ter Beek, Fabio Gadducci

Publication date: 24 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.08.022

zbMATH Keywords

process calculiteam automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A process algebraic view of input/output automata
• Modularity for teams of I/O automata
• A calculus of communicating systems
• Turning SOS rules into equations
• A structural approach to operational semantics
• Process algebra for synchronous communication
• The meaning of negative premises in transition system specifications
• Team Automata for CSCW – A Survey –
• CONCUR 2003 - Concurrency Theory

This page was built for publication: A Calculus for Team Automata