{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214907},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424970"},{"type":"electronic","value":"9783540446859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44685-0_26","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:16:21Z","timestamp":1186726581000},"page":"381-395","source":"Crossref","is-referenced-by-count":44,"title":["A Static Analysis Technique for Graph Transformation Systems"],"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":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,22]]},"reference":[{"key":"26_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":"26_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-49019-1_6","volume-title":"Proceedings of FoSSaCS\u2019 99","author":"P. Baldan","year":"1999","unstructured":"P. Baldan, A. Corradini, and U. Montanari. Unfolding and Event Structure Semantics for Graph Grammars. In W. Thomas, editor, Proceedings of FoSSaCS\u2019 99, volume 1578 of LNCS, pages 73\u201389. Springer Verlag, 1999."},{"key":"26_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-61604-7_69","volume-title":"Proceedings CONCUR\u201996","author":"A. Corradini","year":"1996","unstructured":"A. Corradini. Concurrent Graph and Term Graph Rewriting. In U. Montanari and V. Sassone, editors, Proceedings CONCUR\u201996, volume 1119 of LNCS, pages 438\u2013464. Springer Verlag, 1996."},{"key":"26_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025714","volume-title":"Proceedings of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology","author":"H. Ehrig","year":"1979","unstructured":"H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Proceedings of the 1st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS, pages 1\u201369. Springer Verlag, 1979."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools. World Scientific, 1999.","DOI":"10.1142\/4180"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution. World Scientific, 1999.","DOI":"10.1142\/4181"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575\u2013591, 1991.","journal-title":"Acta Informatica"},{"issue":"2\u20133","key":"26_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2\u20133):151\u2013195, 1994.","journal-title":"Science of Computer Programming"},{"key":"26_CR9","series-title":"Lect Notes Comput Sci","first-page":"87","volume-title":"Proc. of TACAS\u201996","author":"J. Esparza","year":"1966","unstructured":"J. Esparza, S. R\u2126er, and W. Vogler. An improvement of McMillan\u2019s unfolding algorithm. In T. Margaria and B. Steffen, editors, Proc. of TACAS\u201996, volume 1055 of LNCS, pages 87\u2013106. Springer-Verlag, 1966."},{"key":"26_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Proceedings 9th International Conference on Rewriting Techniques and Applications","author":"T. Genet","year":"1998","unstructured":"T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In T. Nipkow, editor, Proceedings 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 151\u2013165. Springer Verlag, 1998."},{"key":"26_CR11","unstructured":"M. Koch. Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Systems. PhD thesis, Technische Universit\u00e4t Berlin, 2000."},{"key":"26_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/3-540-44450-5_30","volume-title":"Proc. of FST TCS 2000","author":"B. K\u00f6nig","year":"2000","unstructured":"B. K\u00f6nig. A general framework for types in graph rewriting. In Proc. of FST TCS 2000, volume 1974 of LNCS, pages 373\u2013384. Springer-Verlag, 2000."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J. Meseguer","year":"1990","unstructured":"J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105\u2013155, 1990.","journal-title":"Information and Computation"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, 13:85\u2013108, 1981.","journal-title":"Theoretical Computer Science"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag, 1985.","DOI":"10.1007\/978-3-642-69968-9"},{"key":"26_CR17","unstructured":"L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universit\u00e4t Berlin, 1996."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 1997.","DOI":"10.1142\/9789812384720"},{"key":"26_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BFb0055644","volume-title":"Proceedings of CONCUR\u201998","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","CONCUR 2001 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44685-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:11:46Z","timestamp":1556734306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44685-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424970","9783540446859"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44685-0_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}