{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:45Z","timestamp":1761611205813},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_31","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:20:53Z","timestamp":1178371253000},"page":"440-456","source":"Crossref","is-referenced-by-count":5,"title":["Open Ended Systems, Dynamic Bisimulation and Tile Logic"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bruni","sequence":"first","affiliation":[]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]},{"given":"Vladimiro","family":"Sassone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"K. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In Proc. 13th LICS, IEEE Press, 1998.","DOI":"10.1109\/LICS.1998.705652"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"G. Berry and G. Boudol. The chemical abstract machine. Theoret. Comput. Sci, 96(1):217\u2013248, 1992.","journal-title":"Theoret. Comput. Sci"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can\u2019t be traced. Journal of the ACM, 42(1):232\u2013268, 1995.","journal-title":"Journal of the ACM"},{"key":"31_CR4","unstructured":"R. Bruni, J. Meseguer, and U. Montanari. Process and term tile logic. Technical Report SRI-CSL-98-06. SRI International, 1998."},{"key":"31_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-540-49020-3_5","volume-title":"Proc. FASE\u201999","author":"R. Bruni","year":"1999","unstructured":"R. Bruni, J. Meseguer, and U. Montanari. Executable tile specifications for process calculi. In Proc. FASE\u201999, vol. 1577 of LNCS, pages 60\u201376, Springer, 1999."},{"key":"31_CR6","unstructured":"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."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1006\/inco.1999.2819","volume":"156","author":"R. Bruni","year":"2000","unstructured":"R. Bruni and U. Montanari. Zero-safe nets: Comparing the collective and individual token approaches. Information and Computation, 156:46\u201389, 2000.","journal-title":"Information and Computation"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"A. Corradini, R. Heckel, and U. Montanari. From SOS specifications to structured coalgebras: how to make bisimulation a congruence. In Proc. CMCS\u201999, vol. 19 of Elect. Notes in Th. Comput. Sci., Elsevier Science, 1999.","DOI":"10.1016\/S1571-0661(05)80273-7"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(92)90087-V","volume":"103","author":"A. Corradini","year":"1992","unstructured":"A. Corradini and U. Montanari. An algebraic semantics for structured transition systems and its application to logic programs. Th. Comput. Sci., 103:51\u2013106, 1992.","journal-title":"Th. Comput. Sci"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone De","year":"1985","unstructured":"R. De Simone. Higher level synchronizing devices in MEIJE-SCCS. Theoret. Comput. Sci., 37:245\u2013267, 1985.","journal-title":"Theoret. Comput. Sci"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/inco.1999.2825","volume":"156","author":"G.L. Ferrari","year":"2000","unstructured":"G.L. Ferrari and U. Montanari. Tile formats for located and mobile systems. Information and Computation, 156:173\u2013235, 2000.","journal-title":"Information and Computation"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"F. Gadducci and U. Montanari. The tile model. In Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, 2000. To appear.","DOI":"10.7551\/mitpress\/5641.003.0010"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202\u2013260, 1992.","journal-title":"Information and Computation"},{"key":"31_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/BFb0032056","volume-title":"Proc. ICALP\u201990","author":"K.G. Larsen","year":"1990","unstructured":"K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. In Proc. ICALP\u201990, vol. 443 of LNCS, pages 526\u2013539, Springer, 1990."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"F.W. Lawvere","year":"1963","unstructured":"F.W. Lawvere. Functorial semantics of algebraic theories. Proc. National Academy of Science, 50:869\u2013872, 1963.","journal-title":"Proc. National Academy of Science"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96:73\u2013155, 1992.","journal-title":"Theoret. Comput. Sci"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"J. Meseguer and U. Montanari. Mapping tile logic into rewriting logic. In Proc. WADT\u201997, vol. 1376 of Lect. Notes in Comput. Sci., pages 62\u201391, Springer, 1998.","DOI":"10.1007\/3-540-64299-4_27"},{"key":"31_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"R. Milner. A Calculus of Communicating Systems, vol. 92 of LNCS Springer, 1980."},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100:1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"31_CR20","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1992-16206","volume":"16","author":"U. Montanari","year":"1992","unstructured":"U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, 16:171\u2013196, 1992.","journal-title":"Fundamenta Informaticae"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"U. Montanari and C. Talcott. Can actors and \u03c0-agents live together? In Proc. HOOTS\u201997, vol. 10 of Elect. Notes in Th. Comput. Sci., Elsevier Science, 1998.","DOI":"10.1016\/S1571-0661(05)80697-8"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proc. 5th G-I Conference, vol. 104 of Lect. Notes in Comput. Sci., pages 167\u2013183, Springer, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"31_CR23","unstructured":"G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981."},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"P. Sewell. From rewrite rules to bisimulation congruences. In Proc. CONCUR\u201998, vol. 1466 of Lect. Notes in Comput. Sci., pages 269\u2013284, Springer, 1998.","DOI":"10.1007\/BFb0055628"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T03:35:47Z","timestamp":1707881747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}