Modularity for teams of I/O automata

Input/Output automata (or I/O automata) were originally introduced by Tuttle and Lynch [10,13] as a model for distributed computations in asynchronous networks and as a means of constructing correctness proofs of distributed algorithms. Basically, an I/O automaton is a transition system with action names labeling its transitions. A distinction is made between internal actions and external (i.e., input and output) actions used for communication with the environment, which may consist of other I/O automata. They can be composed using a synchronous product construction yielding a new I/O automaton. Many variants of I/O automata were considered and the model is now widely used for describing reactive, distributed systems [6–8,10–13].

[1]  Scott A. Smolka,et al.  Composition and Behaviors of Probabilistic I/O Automata , 1994, Theor. Comput. Sci..

[2]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1991, Inf. Comput..

[3]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[5]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[6]  Nancy A. Lynch,et al.  I/O automaton models and proofs for shared-key communication systems , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[7]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[8]  Nancy A. Lynch.  Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, , 2003, CONCUR.

[9]  Nancy A. Lynch,et al.  Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[10]  Clarence A. Ellis.  Team automata for groupware systems , 1997, GROUP '97.

[11]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[12]  Nancy A. Lynch,et al.  Introduction to the Theory of Nested Transactions , 1986, Theor. Comput. Sci..

[13]  Maurice H. ter Beek,et al.  Team Automata: A Formal Approach to the Modeling of Collaboration Between System Components , 2003 .

[14]  Olaf Müller,et al.  A verification environment for I-O-automata based on formalized meta-theory , 1998 .

[15]  Maurice H. ter Beek,et al.  Team Automata Satisfying Compositionality , 2003, FME.

[16]  Nancy A. Lynch,et al.  Introduction to the Theory of Nested Transactions , 1986, Theoretical Computer Science.

[17]  Bernd Grobauer,et al.  From I/O Automata to Timed I/O Automata , 1999, TPHOLs.

[18]  Grzegorz Rozenberg,et al.  Synchronizations in Team Automata for Groupware Systems , 2003, Computer Supported Cooperative Work (CSCW).

[19]  Nancy A. Lynch,et al.  Liveness in Timed and Untimed Systems , 1994, Inf. Comput..

[20]  Judi Romijn,et al.  Tackling the RPC-Memory Specification Problem with I/O Automata , 1994, Formal Systems Specification.

[21]  Nancy A. Lynch,et al.  I/o automata: a model for discrete event systems , 1988 .