Abstract
The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest congruence for ccs which is also a (weak) bisimulation, reconciles the bisimilarity as congruence property with such axioms and with the specification of open ended systems, where states can be reconfigured at run-time, at the cost of an infinitary operation at the meta-level. We show that the compositional framework offered by tile logic is suitable to deal with structural axioms and open ended systems specifications, allowing for a finitary presentation of context closure.
Chapter PDF
Similar content being viewed by others
References
K. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In Proc. 13th LICS, IEEE Press, 1998.
G. Berry and G. Boudol. The chemical abstract machine. Theoret. Comput. Sci, 96(1):217–248, 1992.
B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42(1):232–268, 1995.
R. Bruni, J. Meseguer, and U. Montanari. Process and term tile logic. Technical Report SRI-CSL-98-06. SRI International, 1998.
R. Bruni, J. Meseguer, and U. Montanari. Executable tile specifications for process calculi. In Proc. FASE’99, vol. 1577 of LNCS, pages 60–76, Springer, 1999.
R. Bruni, J. Meseguer, and U. Montanari. Symmetric monoidal and cartesian double categories as a semantic framework for tile logic. Mathematical Structures in Computer Science, 2000. To appear.
R. Bruni and U. Montanari. Zero-safe nets: Comparing the collective and individual token approaches. Information and Computation, 156:46–89, 2000.
A. Corradini, R. Heckel, and U. Montanari. From SOS specifications to structured coalgebras: how to make bisimulation a congruence. In Proc. CMCS’99, vol. 19 of Elect. Notes in Th. Comput. Sci., Elsevier Science, 1999.
A. Corradini and U. Montanari. An algebraic semantics for structured transition systems and its application to logic programs. Th. Comput. Sci., 103:51–106, 1992.
R. De Simone. Higher level synchronizing devices in MEIJE-SCCS. Theoret. Comput. Sci., 37:245–267, 1985.
G.L. Ferrari and U. Montanari. Tile formats for located and mobile systems. Information and Computation, 156:173–235, 2000.
F. Gadducci and U. Montanari. The tile model. In Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, 2000. To appear.
J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202–260, 1992.
K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. In Proc. ICALP’90, vol. 443 of LNCS, pages 526–539, Springer, 1990.
F.W. Lawvere. Functorial semantics of algebraic theories. Proc. National Academy of Science, 50:869–872, 1963.
J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96:73–155, 1992.
J. Meseguer and U. Montanari. Mapping tile logic into rewriting logic. In Proc. WADT’97, vol. 1376 of Lect. Notes in Comput. Sci., pages 62–91, Springer, 1998.
R. Milner. A Calculus of Communicating Systems, vol. 92 of LNCS Springer, 1980.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100:1–77, 1992.
U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, 16:171–196, 1992.
U. Montanari and C. Talcott. Can actors and π-agents live together? In Proc. HOOTS’97, vol. 10 of Elect. Notes in Th. Comput. Sci., Elsevier Science, 1998.
D. Park. Concurrency and automata on infinite sequences. In Proc. 5th G-I Conference, vol. 104 of Lect. Notes in Comput. Sci., pages 167–183, Springer, 1981.
G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981.
P. Sewell. From rewrite rules to bisimulation congruences. In Proc. CONCUR’98, vol. 1466 of Lect. Notes in Comput. Sci., pages 269–284, Springer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruni, R., Montanari, U., Sassone, V. (2000). Open Ended Systems, Dynamic Bisimulation and Tile Logic. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. TCS 2000. Lecture Notes in Computer Science, vol 1872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44929-9_31
Download citation
DOI: https://doi.org/10.1007/3-540-44929-9_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67823-6
Online ISBN: 978-3-540-44929-4
eBook Packages: Springer Book Archive