Skip to main content
SpringerLink
Log in

Team Automata Satisfying Compositionality

  • Conference paper
  • First Online:
FME 2003: Formal Methods (FME 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2805))

Included in the following conference series:

Abstract

A team automaton is said to satisfy compositionality if its behaviour can be described in terms of the behaviour of its constituting component automata. As an initial investigation of the conditions under which team automata satisfy compositionality, we study their computations and behaviour in relation to those of their constituting component automata. We show that the construction of team automata according to certain natural types of synchronization guarantees compositionality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. ter Beek, M.H.: Team Automata—A Formal Approach to the Modeling of Collaboration Between System Components. Ph.D. thesis, Leiden Institute of Advanced Computer Science, Universiteit Leiden (2003)

    Google Scholar 

  2. ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Team Automata for CSCW. In: Weber, H., Ehrig, H., Reisig, W. (eds.) Proc. 2nd Int. Coll. on Petri Net Technologies for Modelling Communication Based Systems. Fraunhofer Institute for Software and Systems Engineering, pp. 1–20 (2001)

    Google Scholar 

  3. ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Synchronizations in team automata for groupware systems. Computer Supported Cooperative Work—The Journal of Collaborative Computing 12(1), 21–69 (2003)

    Article  Google Scholar 

  4. Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier Science, Amsterdam (2001)

    MATH  Google Scholar 

  5. Carmona, J., Cortadella, J.: Input/Output Compatibility of Reactive Systems. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 360–377. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Carmona, J., Cortadella, J., Pastor, E.: Synthesis of Reactive Systems: Application to Asynchronous Circuit Design. In: Cortadella, J., Yakovlev, A., Rozenberg, G. (eds.) Concurrency and Hardware Design— Advances in Petri Nets, pp. 107–151. Springer, Heidelberg (2002)

    Google Scholar 

  7. De Simone, R.: Langages Infinitaires et Produit de Mixage. Theoretical Computer Science 31, 83–100 (1984)

    Article  MathSciNet  Google Scholar 

  8. Drusinsky, D., Harel, D.: On the Power of Bounded Concurrency I: Finite Automata. Journal of the ACM 41(3), 517–539 (1994)

    Article  MathSciNet  Google Scholar 

  9. Ellis, C.A.: Team Automata for Groupware Systems. In: Hayne, S.C., Prinz, W. (eds.) Proc. Int. Conf. on Supporting Group Work: The Integration Challenge, pp. 415–424. ACM Press, New York (1997)

    Chapter  Google Scholar 

  10. Ginsburg, S., Spanier, E.H.: Mappings of Languages by Two-Tape Devices. Journal of the ACM 12(3), 423–434 (1965)

    Article  MathSciNet  Google Scholar 

  11. Harel, D.: Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming 8, 231–274 (1987)

    Article  MathSciNet  Google Scholar 

  12. Hirst, T., Harel, D.: On the Power of Bounded Concurrency II: Pushdown Automata. Journal of the ACM 41(3), 540–554 (1994)

    Article  MathSciNet  Google Scholar 

  13. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  14. Jantzen, M.: The Power of Synchronizing Operations on Strings. Theoretical Computer Science 14, 127–154 (1981)

    Article  MathSciNet  Google Scholar 

  15. Jonsson, B.: Compositional Verification of Distributed Systems. Ph.D. thesis, Department of Computer Systems, Uppsala University (1987)

    Google Scholar 

  16. Jonsson, B.: Compositional Specification and Verification of Distributed Systems. ACM Transactions on Programming Languages and Systems 16(2), 259–303 (1994)

    Article  Google Scholar 

  17. Kimura, T.: An Algebraic System for Process Structuring and Interprocess Communication. In: Proc. 8th Symp. on Theory of Computing, pp. 92–100. ACM Press, New York (1976)

    Google Scholar 

  18. Lanotte, R., Maggiolo-Schettini, A., Peron, A.: Timed Cooperating Automata. Fundamenta Informaticae 42, 1–21 (2000)

    Article  MathSciNet  Google Scholar 

  19. Latteux, M., Roos, Y.: Synchronized Shuffle and Regular Languages. In: Karhumäki, J., Maurer, H.A., Păun, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 35–44. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. Lynch, N.A., Tuttle, M.R.: An Introduction to Input/Output Automata. CWI Quarterly 2(3), 219–246 (1989)

    MathSciNet  MATH  Google Scholar 

  21. von Oheimb, D.: Interacting State Machines: A Stateful Approach to Proving Security. In: Abdallah, A.E., Ryan, P.Y.A., Schneider, S. (eds.) FASec 2002. LNCS, vol. 2629, pp. 15–32. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  22. von Oheimb, D., Lotz, V.: Formal Security Analysis with Interacting State Machines. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol. 2502, pp. 212–228. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)

    Google Scholar 

  24. Salomaa, A.: Formal Languages. Academic Press, London (1973)

    MATH  Google Scholar 

  25. van de Snepscheut, J.L.A.: Trace Theory and VLSI Design. LNCS, vol. 200. Springer, Heidelberg (1985)

    Book  Google Scholar 

  26. Tuttle, M.R.: Hierarchical Correctness Proofs for Distributed Algorithms. Master’s thesis, Department of Electrical Engineering and Computer Science, MIT (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Scienza e Tecnologie dell’Informazione, CNR,Area della Ricerca di Pisa, Via G. Moruzzi 1, 56124, Pisa, Italy

    Maurice H. ter Beek

  2. Leiden Institute of Advanced Computer Science, Universiteit Leiden, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    Jetty Kleijn

Authors
  1. Maurice H. ter Beek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jetty Kleijn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Communication Engineering, Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-10-1-Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Keijiro Araki

  2. Istituto di Scienza e Tecnologie dell’Informazione “A. Faedo”, ISTI - CNR, Pisa, Italy

    Stefania Gnesi

  3. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy

    Dino Mandrioli

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

ter Beek, M.H., Kleijn, J. (2003). Team Automata Satisfying Compositionality. In: Araki, K., Gnesi, S., Mandrioli, D. (eds) FME 2003: Formal Methods. FME 2003. Lecture Notes in Computer Science, vol 2805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45236-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45236-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40828-4

  • Online ISBN: 978-3-540-45236-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation