Team Automata for CSCW - A Survey

Team automata have been proposed as a formal framework for modelling both the conceptual and the architectural level of groupware systems. They are defined in terms of component automata (labelled transition systems) together with an interconnection mechanism which is based on shared actions (synchronizations). Components can be combined in different fashions depending on which actions are to be shared, and when. This set-up makes it possible to distinguish between different types of synchronizations and allows to represent hierarchical systems. A survey is presented including a brief comparison with some related models.

[1]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[3]  Rémi Morin,et al.  Decompositions of Asynchronous Systems , 1998, CONCUR.

[4]  André Arnold.  Synchronized behaviours of processes and rational relations , 2004, Acta Informatica.

[5]  Christine Duboc,et al.  Mixed Product and Asynchronous Automata , 1986, Theor. Comput. Sci..

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

[7]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

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

[9]  Andrew Tokmakoff,et al.  Modelling Dynamic Agent Systems with Cooperating Automata , 1999, PDPTA.

[10]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[11]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[12]  Grzegorz Rozenberg,et al.  Team automata for spatial access control , 2001, ECSCW.

[13]  Ryszard Janicki,et al.  Specification and Analysis of Concurrent Systems: The Cosy Approach , 1992 .

[14]  Jetty Kleijn,et al.  Net-based control versus rational control The relation between ITNC vector languages and rational relations , 1997, Acta Informatica.

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

[16]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[17]  Grzegorz Rozenberg,et al.  Vector controlled concurrent systems. Part I: basic classes , 1990 .

[18]  Grzegorz Rozenberg,et al.  Vector controlled concurrent systems, part II: comparisons , 1991, Fundam. Informaticae.

[19]  Wolfgang Reisig,et al.  Lectures on Petri Nets II: Applications , 1996, Lecture Notes in Computer Science.

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

[21]  André Arnold,et al.  Finite transition systems , 1994 .

[22]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

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

[24]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.