{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:59:07Z","timestamp":1794383947937,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540249368","type":"print"},{"value":"9783540318477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31847-7_1","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T14:51:47Z","timestamp":1294411907000},"page":"3-23","source":"Crossref","is-referenced-by-count":1,"title":["On the Concurrent Semantics of Algebraic Graph Grammars"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Corradini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/633642.803973","volume":"4","author":"T. Agerwala","year":"1973","unstructured":"Agerwala, T., Flynn, M.: Comments on capabilities, limitations and \u201ccorrectness\u201d of Petri nets. Computer Architecture News\u00a04(2), 81\u201386 (1973)","journal-title":"Computer Architecture News"},{"key":"1_CR2","unstructured":"Baldan, P.: 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":"1_CR3","doi-asserted-by":"crossref","unstructured":"Baldan, P., Busi, N., Corradini, A., Pinna, G.M.: Domain and event structure semantics for Petri nets with read and inhibitor arcs. Theoretical Computer Science (2004) (to appear)","DOI":"10.1016\/S0304-3975(04)00263-4"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-44618-4_32","volume-title":"CONCUR 2000 - Concurrency Theory","author":"P. Baldan","year":"2000","unstructured":"Baldan, P., Busi, N., Corradini, A., Pinna, G.M.: Functional concurrent semantics for petri nets with read and inhibitor arcs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 442\u2013457. Springer, Heidelberg (2000)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-44685-0_26","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A static analysis technique for graph transformation systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 381\u2013395. Springer, Heidelberg (2001)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-28644-8_6","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P. Baldan","year":"2004","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: Verifying finite-state graph grammars: An unfolding-based approach. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 83\u201398. Springer, Heidelberg (2004)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3060","volume":"171","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures and processes. Information and Computation\u00a0171(1), 1\u201349 (2001)","journal-title":"Information and Computation"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0055061","volume-title":"Automata, Languages and Programming","author":"P. Baldan","year":"1998","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Concatenable graph processes: Relating processes and derivation traces. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 283\u2013295. Springer, Heidelberg (1998)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-49019-1_6","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Baldan","year":"1999","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Unfolding and event structure semantics for graph grammars. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 73\u201389. Springer, Heidelberg (1999)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-46464-8_11","volume-title":"Theory and Application of Graph Transformations","author":"P. Baldan","year":"2000","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Unfolding of double-pushout graph grammars is a coreflection. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 145\u2013163. Springer, Heidelberg (2000)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-45711-9_11","volume-title":"Formal and Natural Computing","author":"P. Baldan","year":"2002","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Bisimulation equivalences for graph grammars. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 158\u2013190. Springer, Heidelberg (2002)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-40020-2_9","volume-title":"Recent Trends in Algebraic Development Techniques","author":"P. Baldan","year":"2003","unstructured":"Baldan, P., Corradini, A., Montanari, U., Ribeiro, L.: Coreflective concurrent semantics for single-pushout graph grammars. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol.\u00a02755, pp. 165\u2013184. Springer, Heidelberg (2003)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-45832-8_4","volume-title":"Graph Transformation","author":"P. Baldan","year":"2002","unstructured":"Baldan, P., K\u00f6nig, B.: Approximating the behaviour of graph transformation systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 14\u201330. Springer, Heidelberg (2002)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0167-6423(97)00007-5","volume":"30","author":"F. Bueno","year":"1998","unstructured":"Bueno, F., Hermenegildo, M., Montanari, U., Rossi, F.: Partial order and contextual net semantics for atomic and locally atomic CC programs. Science of Computer Programming\u00a030, 51\u201382 (1998)","journal-title":"Science of Computer Programming"},{"key":"1_CR15","unstructured":"Busi, N.: Petri Nets with Inhibitor and Read Arcs: Semantics, Analysis and Application to Process Calculi. PhD thesis, University of Siena, Department of Computer Science (1998)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-56863-8_47","volume-title":"Application and Theory of Petri Nets 1993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hansen, N.D.: Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol.\u00a0691, pp. 186\u2013205. Springer, Heidelberg (1993)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-61604-7_69","volume-title":"CONCUR \u201996: Concurrency Theory","author":"A. Corradini","year":"1996","unstructured":"Corradini, A.: Concurrent graph and term graph rewriting. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 438\u2013464. Springer, Heidelberg (1996)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-57787-4_6","volume-title":"Graph Transformations in Computer Science","author":"A. Corradini","year":"1994","unstructured":"Corradini, A., Ehrig, H., L\u00f6we, M., Montanari, U., Rossi, F.: Abstract graph derivations in the double-pushout approach. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol.\u00a0776, pp. 86\u2013103. Springer, Heidelberg (1994)"},{"key":"1_CR19","unstructured":"Corradini, A., Ehrig, H., L\u00f6we, M., Montanari, U., Rossi, F.: An event structure semantics for safe graph grammars. In: Olderog, E.-R. (ed.) Programming Concepts, Methods and Calculi. IFIP Transactions, vol.\u00a0A-56, pp. 423\u2013444. North-Holland, Amsterdam (1994)"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Grammars and Their Application to Computer Science","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Ehrig, H., L\u00f6we, M., Montanari, U., Rossi, F.: An event structure semantics for graph grammars with parallel productions. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol.\u00a01073, Springer, Heidelberg (1996)"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae\u00a026, 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"1_CR22","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic Approaches to Graph Transformation I: Basic Concepts and Double Pushout Approach. In: Rozenberg [45], ch. 3"},{"key":"1_CR23","unstructured":"De Francesco, N., Montanari, U., Ristori, G.: Modeling Concurrent Accesses to Shared Data via Petri Nets. In: Programming Concepts, Methods and Calculi, IFIP Transactions, vol.\u00a0A-56, pp. 403\u2013422. North Holland, Amsterdam (1994)"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/BF03036469","volume":"33","author":"P. Degano","year":"1996","unstructured":"Degano, P., Meseguer, J., Montanari, U.: Axiomatizing the algebra of net computations and processes. Acta Informatica\u00a033, 641\u2013647 (1996)","journal-title":"Acta Informatica"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"H. Ehrig","year":"1987","unstructured":"Ehrig, H.: Tutorial introduction to the algebraic approach of graph-grammars. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol.\u00a0291, pp. 3\u201314. Springer, Heidelberg (1987)"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001353","volume":"1","author":"H. Ehrig","year":"1991","unstructured":"Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F.: Parallelism and concurrency in High-Level Replacement Systems. Mathematical Structures in Computer Science\u00a01, 361\u2013404 (1991)","journal-title":"Mathematical Structures in Computer Science"},{"key":"1_CR27","unstructured":"Ehrig, H., Heckel, R., Korff, M., L\u201dowe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation II: Single pushout approach and comparison with double pushout approach. In: Rozenberg [45], ch. 4"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","volume":"57","author":"U. Golz","year":"1983","unstructured":"Golz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Information and Control\u00a057, 125\u2013147 (1983)","journal-title":"Information and Control"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Janicki, R., Koutny, M.: Invariant semantics of nets with inhibitor arcs. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-54430-5_97"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1153","volume":"123","author":"R. Janicki","year":"1995","unstructured":"Janicki, R., Koutny, M.: Semantics of inhibitor nets. Information and Computation\u00a0123, 1\u201316 (1995)","journal-title":"Information and Computation"},{"key":"1_CR31","unstructured":"Kreowski, H.-J.: Manipulation von Graphmanipulationen. PhD thesis, Technische Universit\u00e4t Berlin (1977)"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Lack","year":"2004","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 273\u2013288. Springer, Heidelberg (2004)"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","volume":"109","author":"M. L\u00f6we","year":"1993","unstructured":"L\u00f6we, M.: Algebraic approach to single-pushout graph transformation. Theoretical Computer Science\u00a0109, 181\u2013224 (1993)","journal-title":"Theoretical Computer Science"},{"key":"1_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer, Dordrecht (1993)"},{"issue":"1-2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(95)00121-2","volume":"153","author":"J. Meseguer","year":"1996","unstructured":"Meseguer, J., Montanari, U., Sassone, V.: Process versus unfolding semantics for Place\/Transition Petri nets. Theoretical Computer Science\u00a0153(1-2), 171\u2013210 (1996)","journal-title":"Theoretical Computer Science"},{"key":"1_CR36","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1017\/S0960129597002314","volume":"7","author":"J. Meseguer","year":"1997","unstructured":"Meseguer, J., Montanari, U., Sassone, V.: On the semantics of Place\/Transition Petri nets. Mathematical Structures in Computer Science\u00a07, 359\u2013397 (1997)","journal-title":"Mathematical Structures in Computer Science"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Montanari, U., Rossi, F.: Contextual nets. Acta Informatica\u00a032(6) (1995)","DOI":"10.1007\/BF01178907"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science\u00a013, 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"1_CR39","volume-title":"Petri Net Theory and the Modelling of Systems","author":"J.L. Peterson","year":"1981","unstructured":"Peterson, J.L.: Petri Net Theory and the Modelling of Systems. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"1_CR40","unstructured":"Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Schriften des Institutes f\u00fcr Instrumentelle Matematik, Bonn (1962)"},{"key":"1_CR41","unstructured":"Petri, C.A.: Non-sequential processes. Technical Report GMD-ISF-77-5, Gesellshaft f\u00fcr Mathematik und Datenverarbeitung, Bonn (1977)"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Petri Nets: An Introduction. In: EACTS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)","DOI":"10.1007\/978-3-642-69968-9_1"},{"key":"1_CR43","unstructured":"Ribeiro, L.: Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universit\u00e4t Berlin (1996)"},{"key":"1_CR44","unstructured":"Ristori, G.: Modelling Systems with Shared Resources via Petri Nets. PhD thesis, Department of Computer Science - University of Pisa (1994)"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01. World Scientific, Foundations (1997)","DOI":"10.1142\/9789812384720"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-57787-4_21","volume-title":"Graph Transformations in Computer Science","author":"G. Schied","year":"1994","unstructured":"Schied, G.: On relating rewriting systems and graph grammars to event structures. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol.\u00a0776, pp. 326\u2013340. Springer, Heidelberg (1994)"},{"key":"1_CR47","unstructured":"Scott, D.S.: Outline of a mathematical theory of computation. In: Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systems, pp. 169\u2013176 (1970)"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) Proceedings of MFCS 1989. LNCS, vol.\u00a039, pp. 237\u2013248. Springer, Heidelberg (1989)","DOI":"10.1007\/3-540-51486-4_71"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/3-540-63165-8_209","volume-title":"Automata, Languages and Programming","author":"W. Vogler","year":"1997","unstructured":"Vogler, W.: Efficiency of asynchronous systems and read arcs in Petri nets. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 538\u2013548. Springer, Heidelberg (1997)"},{"key":"1_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BFb0055644","volume-title":"CONCUR \u201998 Concurrency Theory","author":"W. Vogler","year":"1998","unstructured":"Vogler, W., Semenov, A., Yakovlev, A.: Unfolding and finite prefix for nets with read arcs. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 501\u2013516. Springer, Heidelberg (1998)"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Winskel, G.: Event Structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 325\u2013392. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-17906-2_31"}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Software and Systems Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31847-7_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:28:27Z","timestamp":1605742107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31847-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249368","9783540318477"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31847-7_1","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b106390","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}