{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:43Z","timestamp":1761611203655},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540431909"},{"type":"electronic","value":"9783540457114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45711-9_11","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T02:31:39Z","timestamp":1180405899000},"page":"158-187","source":"Crossref","is-referenced-by-count":7,"title":["Bisimulation Equivalences for Graph Grammars"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Corradini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,14]]},"reference":[{"key":"11_CR1","unstructured":"P. Baldan. Modelling Concurrent Computations: From Contextual Petri Nets to Graph Grammars. PhD thesis, Department of Computer Science, University of Pisa, 2000. Available as technical report n. TD-1\/00."},{"key":"11_CR2","unstructured":"R. Bartolini. Model checking di propriet\u00e1 causali di reti di Petri. MSc thesis, University of Pisa, 1999. (In Italian)."},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BFb0055061","volume-title":"Concatenable GraphProcesses: Relating Processes and Derivation Traces","author":"P. Baldan","year":"1998","unstructured":"P. Baldan, A. Corradini, and U. Montanari. Concatenable GraphProcesses: Relating Processes and Derivation Traces. In Proceedings of ICALP\u201998, volume 1443 of LNCS, pages 283\u2013295. Springer Verlag, 1998."},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BFb0053542","volume-title":"An Event Structure Semantics for P\/T Contextual Nets: Asymmetric Event Structures","author":"P. Baldan","year":"1998","unstructured":"P. Baldan, A. Corradini, and U. Montanari. An Event Structure Semantics for P\/T Contextual Nets: Asymmetric Event Structures. In M. Nivat, Editor, Proceedings of FoSSaCS\u2019 98, volume 1378 of LNCS, pages 63\u201380. Springer Verlag, 1998."},{"key":"11_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-49019-1_6","volume-title":"Unfolding and Event Structure Semantics for GraphGram mars","author":"P. Baldan","year":"1999","unstructured":"P. Baldan, A. Corradini, and U. Montanari. Unfolding and Event Structure Semantics for GraphGram mars. In W. Thomas, Editor, Proceedings of FoSSaCS\u2019 99, volume 1578 of LNCS, pages 73\u201389. Springer Verlag, 1999."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"P. Baldan, A. Corradini, and U. Montanari. Contextual Petri Nets, Asymmetric Event Structures and Processes. To appear in Information and Computation., 2000.","DOI":"10.1006\/inco.2001.3060"},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-44616-3_17","volume-title":"History Preserving Bisimulations for Contextual Nets","author":"P. Baldan","year":"2000","unstructured":"P. Baldan, A. Corradini, and U. Montanari. History Preserving Bisimulations for Contextual Nets. In D. Bert and C. Choppy, Editors, WADT\u201999 Conference Proceedings, number 1827 in LNCS, pages 291\u2013310. Springer Verlag, 2000."},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01178506","volume":"28","author":"E. Best","year":"1991","unstructured":"E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent Bisimulations in Petri Nets. Acta Informatica, 28(3):231\u2013264, 1991.","journal-title":"Acta Informatica"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/0022-0000(87)90025-0","volume":"34","author":"I. Castellani","year":"1987","unstructured":"I. Castellani. Bisimulations and Abstraction Homomorphisms. Journal of Computer and System Sciences, 34(2\/3):210\u2013235, 1987.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR10","unstructured":"I. Castellani, P. Franceschi, and U. Montanari. Labeled Event Structures: A Model for Observable Concurrency. In D. Bj\u00f8rner, Editor, Proceedings of IFIP TC2 Working Conference on Formal Description of Programming Concepts\u2014II, pages 383\u2013389. North-Holland, 1983."},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"A. Corradini, U. Montanari, and F. Rossi. Graph Processes. Fundamenta Informaticae, 26:241\u2013265, 1996.","journal-title":"Fundamenta Informaticae"},{"key":"11_CR12","unstructured":"A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. L\u00f6we. Algebraic Approaches to Graph Transformation I: Basic Concepts and Double Pushout Approach. In G. Rozenberg, Editor, Handbook of Graph Grammars and Computing by Graph Transformation. Volume 1: Foundations. World Scientific, 1997."},{"key":"11_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-61604-7_69","volume-title":"Concurrent Graph and Term Graph Rewriting","author":"A. Corradini","year":"1996","unstructured":"A. Corradini. Concurrent Graph and Term Graph Rewriting. In U. Montanari and V. Sassone, Editors, Proceedings of CONCUR\u201996, volume 1119 of LNCS, pages 438\u2013464. Springer Verlag, 1996."},{"key":"11_CR14","series-title":"Lect Notes Comput Sci","first-page":"239","volume-title":"Causal Trees: Interleaving + Causality","author":"P. Darondeau","year":"1990","unstructured":"P. Darondeau and P Degano. Causal Trees: Interleaving + Causality. In Proc. 18th \u00c9cole de Printemps sur la Semantique de Parallelism, number 469 in LNCS, pages 239\u2013255. Springer Verlag, 1990."},{"key":"11_CR15","series-title":"Lect Notes Comput Sci","first-page":"3","volume-title":"Tutorial Introduction to the Algebraic Approach of Graph-Grammars","author":"H. Ehrig","year":"1987","unstructured":"H. Ehrig. Tutorial Introduction to the Algebraic Approach of Graph-Grammars. In H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, Editors, Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, volume 291 of LNCS, pages 3\u201314. Springer Verlag, 1987."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"H. Ehrig, J. Kreowski, U. Montanari, and G. Rozenberg, Editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 2: Concurrency, Parallelism and Distribution. World Scientific, 1999.","DOI":"10.1142\/4181"},{"key":"11_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-52590-4_47","volume-title":"Towards the Unification of Models of Concurrency","author":"G. Ferrari","year":"1990","unstructured":"G. Ferrari and U. Montanari. Towards the Unification of Models of Concurrency. In A. Arnold, Editor, Proceedings of CAAP\u2019 90, volume 431 of LNCS, pages 162\u2013176. Springer-Verlag, 1990."},{"key":"11_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-540-46464-8_22","volume-title":"A Fully Abstract Model for Graph-Interpreted Temporal Logic","author":"F. Gadducci","year":"2000","unstructured":"F. Gadducci, R. Heckel, and M. Koch. A Fully Abstract Model for Graph-Interpreted Temporal Logic. In H. Ehrig, G. Engels, H.J. Kreowski, and G. Rozenberg, Editors, Proceedings of TAGT\u201998, volume 1764 of LNCS, pages 310\u2013322. Springer Verlag, 2000."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"J. A. Goguen and J. Meseguer. Security Policies and Security Models. In Proceedings 1982 IEEE Symposium on Security and Privacy, pages 11\u201320. IEEE Computer Society, 1982.","DOI":"10.1109\/SP.1982.10014"},{"key":"11_CR20","unstructured":"R. Heckel. Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems. Ph D thesis, TU Berlin, 1998."},{"key":"11_CR21","series-title":"Lect Notes Comput Sci","volume-title":"Integrating the Specification Techniques of Graph Transformation and Temporal Logic","author":"R. Heckel","year":"1997","unstructured":"R. Heckel, H. Ehrig, U. Wolter, and A. Corradini. Integrating the Specification Techniques of Graph Transformation and Temporal Logic. In Proceedings of MFCS\u201997, number 1295 in LNCS. Springer Verlag, 1997."},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic Laws for Indeterminism and Concurrency. Journal of the ACM, 32:137\u2013162, 1985.","journal-title":"Journal of the ACM"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1153","volume":"123","author":"R. Janicki","year":"1995","unstructured":"R. Janicki and M. Koutny. Semantics of Inhibitor Nets. Information and Computation, 123:1\u201316, 1995.","journal-title":"Information and Computation"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from Open Maps. Information and Computation, 127(2):164\u2013185, 1996.","journal-title":"Information and Computation"},{"key":"11_CR25","unstructured":"M. Koch. Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Ssystems. PhD thesis, TU Berlin, 1999."},{"key":"11_CR26","unstructured":"H.-J. Kreowski. Manipulation von Graphmanipulationen. Ph D thesis, Technische Universit\u00e4t Berlin, 1977."},{"key":"11_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BFb0023477","volume-title":"Minimal Transition Systems for History-Preserving Bisimulation","author":"U. Montanari","year":"1997","unstructured":"U. Montanari and M. Pistore. Minimal Transition Systems for History-Preserving Bisimulation. In 14th Annual Symposium on Theoretical Aspects of Computer Science, volume 1200 of LNCS, pages 413\u2013425. Springer Verlag, 1997."},{"key":"11_CR28","unstructured":"U. Montanari and M. Pistore. History-Dependent Automata. Technical Report TR-98-11, Dipartimento di Informatica, 1998. Available as ftp:\/\/ftp.di.unipi.it\/pub\/techreports\/TR-98-11.ps.Z ."},{"key":"11_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/3-540-44612-5_52","volume-title":"Structured Coalgebras and Minimal HDautomata","author":"U. Montanari","year":"2000","unstructured":"U. Montanari and M. Pistore. Structured Coalgebras and Minimal HDautomata. In M. Nielsen and B. Roman, Editors, Proc. of MFCS 2000, volume 1983 of LNCS, pages 569\u2013578. Springer Verlag, 2000."},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"U. Montanari and F. Rossi. Contextual Nets. Acta Informatica, 32(6), 1995.","DOI":"10.1007\/BF01178907"},{"key":"11_CR31","unstructured":"M. Pistore. History Dependent Automata. PhD thesis, Department of Computer Science, University of Pisa, 1999."},{"issue":"12","key":"11_CR32","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/0169-7552(95)00122-0","volume":"28","author":"E. Rudolph","year":"1996","unstructured":"E. Rudolph, J. Grabowski, and P. Graubmann. Tutorial on Message Sequence Charts. Computer Networks and ISDN Systems, 28(12):1629\u20131641, 1996.","journal-title":"Computer Networks and ISDN Systems"},{"key":"11_CR33","unstructured":"L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universit\u00e4t Berlin, 1996."},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"G. Rozenberg, Editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. World Scientific, 1997.","DOI":"10.1142\/9789812384720"},{"issue":"4","key":"11_CR35","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"A. Rabinovich","year":"1988","unstructured":"A. Rabinovich and B. A. Trakhtenbrot. Behavior Structures and Nets. Fundamenta Informatic\u00e6, 11(4):357\u2013404, 1988.","journal-title":"Fundamenta Informatic\u00e6"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"J. van Bentham. Correspondence Theory. In Handbook of Philosophical Logic, volume II. Reidel, 1984.","DOI":"10.1007\/978-94-009-6259-0_4"},{"key":"11_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/3-540-54233-7_158","volume-title":"Deciding History Preserving Bisimilarity","author":"W. Vogler","year":"1991","unstructured":"W. Vogler. Deciding History Preserving Bisimilarity. In J. Leach Albert, B. Monien, and M. Rodr\u00edguez-Artalejo, Editors, Proceedings of ICALP\u201991, volume 510 of LNCS, pages 495\u2013505. Springer-Verlag, 1991."},{"key":"11_CR38","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/3-540-63165-8_209","volume-title":"Efficiency of Asynchronous Systems and Read Arcs in Petri Nets","author":"W. Vogler","year":"1997","unstructured":"W. Vogler. Efficiency of Asynchronous Systems and Read Arcs in Petri Nets. In Proceedings of ICALP\u201997, volume 1256 of LNCS, pages 538\u2013548. Springer Verlag, 1997."},{"key":"11_CR39","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BFb0055644","volume-title":"Unfolding and Finite Prefix for Nets with Read Arcs","author":"W. Vogler","year":"1998","unstructured":"W. Vogler, A. Semenov, and A. Yakovlev. Unfolding and Finite Prefix for Nets with Read Arcs. In Proceedings of CONCUR\u201998, volume 1466 of LNCS, pages 501\u2013516. Springer-Verlag, 1998."}],"container-title":["Lecture Notes in Computer Science","Formal and Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45711-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T08:34:35Z","timestamp":1628930075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45711-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540431909","9783540457114"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/3-540-45711-9_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}