Communicating sequential processes
Communicating sequential processes
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Turning SOS rules into equations
Information and Computation
A process algebraic view of input/output automata
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Team automata for groupware systems
GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
Distributed Algorithms
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Synchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work
Modularity for teams of I/O automata
Information Processing Letters
Electronic Notes in Theoretical Computer Science (ENTCS)
A team automaton scenario for the analysis of security properties of communication protocols
Journal of Automata, Languages and Combinatorics
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
| Hi-index | 0.00 |
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patterns among systems, thus extending I/O automata. Furthermore, for some patterns the language recognized by a team automaton can be specified via those languages recognized by its components. We introduce a process calculus tailored over team automata. Each automaton is described by a process, such that its associated (fragment of a) labeled transition system is bisimilar to the original automaton. The mapping is moreover denotational, since the operators defined on processes are in a bijective correspondence with a chosen family of coordination patterns and that correspondence is preserved by the mapping. We thus extend to team automata a few classical results on I/O automata and their representation by process calculi. Moreover, besides providing a language for expressing team automata, we widen the family of coordination patterns for which an equational characterization of the language associated to a composite automaton can be provided. The latter result is obtained by providing a set of axioms, in ACP-style, for capturing bisimilarity in our calculus.