Computer Supported Cooperative Work (CSCW)

, Volume 12, Issue 1, pp 21–69 | Cite as

Synchronizations in Team Automata for Groupware Systems

  • Maurice H. ter Beek
  • Clarence A. Ellis
  • Jetty Kleijn
  • Grzegorz Rozenberg

Abstract

Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team automata in a mathematically precise way in terms of component automata which synchronizeon certain executions of actions.At the conceptual level, our model serves as a formal framework in whichbasic groupware notions can be rigorously defined and studied.At the architectural level, team automata can be used as building blocksin the design of groupware systems.

CSCW formalization groupware systems master-slave peer-to-peer synchronizations team automata framework 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, A. (1982): Synchronized Behaviours of Processes and Rational Relations. Acta Informatica, vol. 17, pp. 21–29.Google Scholar
  2. Badouel, E., Ph. Darondeau, D. Quichaud and A. Tokmakoff (1999): Modelling Dynamic Agent Systems with Cooperating Automata. Publication Interne 1253, Institut de Recherche en Informatique et Systèmes Aléatoires, Rennes.Google Scholar
  3. Beek, M.H. ter, C.A. Ellis, J. Kleijn and G. Rozenberg (2001a): Team Automata for CSCW. In H. Weber, H. Ehrig and W. Reisig (eds.): Proceedings of the 2nd International Colloquium on Petri Net Technologies for Modelling Communication Based Systems. Berlin, Germany, September 14 to 15, 2001. Berlin: Fraunhofer Institute for Software and Systems Engineering, pp. 1–20. (Also appeared as Technical Report TR-01-07, Leiden Institute of Advanced Computer Science, Universiteit Leiden, 2001.)Google Scholar
  4. Beek, M.H. ter, C.A. Ellis, J. Kleijn and G. Rozenberg (2001b): Team Automata for Spatial Access Control. In W. Prinz, M. Jarke, Y. Rogers, K. Schmidt, and V. Wulf (eds.): ECSCW 2001. Proceedings of the Seventh European Conference on Computer Supported Cooperative Work, Bonn, Germany, September 16 to 20, 2001. Dordrecht: Kluwer Academic Publishers, pp. 59–77. (Also appeared as Technical Report TR-01-03, Leiden Institute of Advanced Computer Science, Universiteit Leiden, 2001.)Google Scholar
  5. Diekert, V. and G. Rozenberg (1995): Book of Traces. Singapore: World Scientific.Google Scholar
  6. Duboc, C. (1986): Mixed Product and Asynchronous Automata. Theoretical Computer Science, vol. 42, pp. 183–199.Google Scholar
  7. Ellis, C.A., S.J. Gibbs and G. Rein (1990): Design and Use of a Group Editor. In G. Cockton (ed.): Engineering for Human Computer Interaction. Amsterdam: North-Holland Publ. Co., pp. 13–25.Google Scholar
  8. Ellis, C.A. (1997): Team Automata for Groupware Systems. In S.C. Hayne and W. Prinz (eds.): GROUP'97. Proceedings of the International ACM SIGGROUP Conference on Supporting Group Work: The Integration Challenge, Phoenix, Arizona, November 16 to 19, 1997. NewYork: ACM Press, pp. 415–424.Google Scholar
  9. Ellis, C.A. and G.J. Nutt (1993): Modelling and Enactment of Workflow Systems. In M. Ajmone Marsan (ed.): Proceedings of the International Conference on Application and Theory of Petri Nets, Chicago, U.S.A.. Lecture Notes in Computer Science, vol. 691. Berlin: Springer-Verlag, pp. 1–16.Google Scholar
  10. Gawlick, R., R. Segala, F.F. Søgaard-Andersen and N. Lynch (1994): Liveness in Timed and Untimed Systems. In S. Abiteboul and E. Shamir (eds.): ICALP'94. Proceedings of the International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 820. Berlin: Springer-Verlag, pp.166–177. (A full version appeared as Technical Report MIT/LCS/TR-587, Massachusetts Institute of Technology, Cambridge, Massachusetts.)Google Scholar
  11. Janicki, R. and P.E. Laurer (1992): Specification and Analysis of Concurrent Systems, The COSY Approach. EATCS Monograhps on Theoretical Computer Science. Berlin: Springer-Verlag.Google Scholar
  12. Keesmaat, N.W. and H.C.M. Kleijn (1997): Net-Based Control versus Rational Control: The Relation between ITNC Vector Languages and Rational Relations. Acta Informatica, vol. 34, pp. 23–57.Google Scholar
  13. Keesmaat, N.W., H.C.M. Kleijn and G. Rozenberg (1990): Vector Controlled Concurrent Systems, Part I: Basic Classes. Fundamenta Informaticae, vol. 13, pp. 275–316.Google Scholar
  14. Keesmaat, N.W., H.C.M. Kleijn and G. Rozenberg (1991): Vector Controlled Concurrent Systems, Part II: Comparisons. Fundamenta Informaticae, vol. 14, pp. 1–38.Google Scholar
  15. Lynch, N.A. and M.R. Tuttle (1989): An Introduction to Input/Output Automata. CWI Quarterly, vol. 2, no. 3, pp. 219–246. (Also appeared as Technical Memo MIT/LCS/TM-373, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1988.)Google Scholar
  16. Lynch, N.A. (1996): Distributed Algorithms. San Mateo, California: Morgan Kaufmann Publishers.Google Scholar
  17. Mazurkiewicz, A. (1989): Basic Notions of Trace Theory. In Lecture Notes in Computer Science, vol. 354. Berlin: Springer-Verlag, pp. 285–363.Google Scholar
  18. Reisig, W. and G. Rozenberg (eds.) (1998): Lectures on Petri Nets I: Basic Models. Lecture Notes in Computer Science, vol. 1491. Berlin: Springer-Verlag.Google Scholar
  19. Sun, C. and C.A. Ellis (1998): Operational Transformation in Real-Time Group Editors: Issues, Algorithms, and Achievements. In J. Grudin and S.E. Poltrock (eds.): CSCW'98. Proceedings of the ACM Conference on Computer Supported Cooperative Work, Seattle, Washington, November 14 to 18, 1998. New York: ACM Press, pp. 59–68.Google Scholar
  20. Tuttle, M.R. (1987): Hierarchical Correctness Proofs for Distributed Algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts. (Also appeared as Technical Report MIT/LCS/TR-387, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1987.)Google Scholar
  21. Zielonka, W. (1987): Notes on Finite Asynchronous Automata. RAIRO Informatique Théoretique et Applications, vol. 21, pp. 99–135.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Maurice H. ter Beek
    • 1
  • Clarence A. Ellis
    • 2
  • Jetty Kleijn
    • 1
  • Grzegorz Rozenberg
    • 1
    • 2
  1. 1.Leiden Institute of Advanced Computer ScienceUniversiteit LeidenLeidenThe Netherlands
  2. 2.Department of Computer ScienceUniversity of ColoradoBoulderU.S.A.

Personalised recommendations