Advertisement

Generalized Synchronization Trees

  • James Ferlez
  • Rance Cleaveland
  • Steve Marcus
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8412)

Abstract

This paper develops a generalized theory of synchronization trees. In their original formulation, synchronization trees modeled the behavior of nondeterministic discrete-time reactive systems and served as the foundational theory upon which process algebra was based. In this work, a more general notion of tree is proposed that is intended to support the modeling of systems with a variety of notions of time, including continuous and hybrid versions. (Bi)simulation is also studied, and it is shown that two notions that coincide in the discrete setting yield different relations in the generalized framework. A CSP-like parallel composition operator for generalized trees is defined as a means of demonstrating the support for compositionality the new framework affords.

Keywords

Partial Order Composition Operator Parallel Composition Label Transition System Process Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. 1.
    Abramsky, S.: A domain equation for bisimulation. Information and Computation 92(2), 161–218 (1991)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Aceto, L., Bloom, B., Vaandrager, F.: Turning SOS rules into equations. Information and Computation 111(1), 1–52 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol. 14. Center for the Study of Language and Information (1988)Google Scholar
  4. 4.
    Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North-Holland, Amsterdam (2001)zbMATHGoogle Scholar
  5. 5.
    Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can’t be traced. J. ACM 42(1), 232–268 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Cuijpers, P.J.L., Reniers, M.A.: Hybrid process algebra. The Journal of Logic and Algebraic Programming 62(2), 191–245 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Cuijpers, P.J.L.: Prefix Orders as a General Model of Dynamics. In: 9th International Workshop on Developments in Computational Models, CONCUR (2013)Google Scholar
  8. 8.
    Davoren, J.M., Tabuada, P.: On Simulations and Bisimulations of General Flow Systems. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 145–158. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Girard, A., Pappas, G.J.: Approximate bisimulation: A bridge between computer science and control theory. Eur. J. Control 17(5-6), 568–578 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Haghverdi, E., Tabuada, P., Pappas, G.J.: Unifying Bisimulation Relations for Discrete and Continuous Systems. In: Proceedings of the International Symposium MTNS 2002, South (2002)Google Scholar
  11. 11.
    Haghverdi, E., Tabuada, P., Pappas, G.J.: Bisimulation relations for dynamical, control, and hybrid systems. Theoretical Comput Science 342, 229–261 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. EATCS Bulletin 62, 62–222 (1997)Google Scholar
  13. 13.
    Jech, T.: Set Theory. Academic Press (1978)Google Scholar
  14. 14.
    Julius, A.A., van der Schaft, A.J.: Bisimulation as congruence in the behavioral setting. In: Proceedings of the 44th IEEE Conference on Decision and Control and 2005 European Control Conference, pp. 814–819 (2005)Google Scholar
  15. 15.
    Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)CrossRefGoogle Scholar
  16. 16.
    Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)CrossRefGoogle Scholar
  17. 17.
    Rounds, W.C.: On the relationships between Scott domains, synchronization trees, and metric spaces. Information and Control 66(1-2), 6–28 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Sangiorgi, D.: An introduction to bisimulation and coinduction. Cambridge University Press, Cambridge (2012)Google Scholar
  19. 19.
    Willems, J.C.: On interconnections, control, and feedback. IEEE Transactions on Automatic Control 42(3), 326–339 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Winskel, G.: Synchronization Trees. Theoretical Computer Science 34(1-2), 33–82 (1984)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • James Ferlez
    • 1
    • 2
  • Rance Cleaveland
    • 1
    • 3
  • Steve Marcus
    • 1
    • 2
  1. 1.The Institute for Systems ResearchUniversity of MarylandUSA
  2. 2.Department of Electrical and Computer EngineeringUniversity of MarylandUSA
  3. 3.Department of Computer ScienceUniversity of MarylandUSA

Personalised recommendations

Cite paper