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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Abramsky, S.: A domain equation for bisimulation. Information and Computation 92(2), 161–218 (1991)
Aceto, L., Bloom, B., Vaandrager, F.: Turning SOS rules into equations. Information and Computation 111(1), 1–52 (1994)
Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol. 14. Center for the Study of Language and Information (1988)
Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North-Holland, Amsterdam (2001)
Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can’t be traced. J. ACM 42(1), 232–268 (1995)
Cuijpers, P.J.L., Reniers, M.A.: Hybrid process algebra. The Journal of Logic and Algebraic Programming 62(2), 191–245 (2005)
Cuijpers, P.J.L.: Prefix Orders as a General Model of Dynamics. In: 9th International Workshop on Developments in Computational Models, CONCUR (2013)
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)
Girard, A., Pappas, G.J.: Approximate bisimulation: A bridge between computer science and control theory. Eur. J. Control 17(5-6), 568–578 (2011)
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)
Haghverdi, E., Tabuada, P., Pappas, G.J.: Bisimulation relations for dynamical, control, and hybrid systems. Theoretical Comput Science 342, 229–261 (2005)
Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. EATCS Bulletin 62, 62–222 (1997)
Jech, T.: Set Theory. Academic Press (1978)
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)
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)
Rounds, W.C.: On the relationships between Scott domains, synchronization trees, and metric spaces. Information and Control 66(1-2), 6–28 (1985)
Sangiorgi, D.: An introduction to bisimulation and coinduction. Cambridge University Press, Cambridge (2012)
Willems, J.C.: On interconnections, control, and feedback. IEEE Transactions on Automatic Control 42(3), 326–339 (1997)
Winskel, G.: Synchronization Trees. Theoretical Computer Science 34(1-2), 33–82 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferlez, J., Cleaveland, R., Marcus, S. (2014). Generalized Synchronization Trees. In: Muscholl, A. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2014. Lecture Notes in Computer Science, vol 8412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54830-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-54830-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54829-1
Online ISBN: 978-3-642-54830-7
eBook Packages: Computer ScienceComputer Science (R0)