{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:01Z","timestamp":1760202541293},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443100"},{"type":"electronic","value":"9783540458326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45832-8_4","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:13:34Z","timestamp":1188314014000},"page":"14-29","source":"Crossref","is-referenced-by-count":24,"title":["Approximating the Behaviour of Graph Transformation Systems"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","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":[[2002,10,24]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/3-540-44685-0_26","volume-title":"Proc. of CONCUR\u2019 01","author":"P. Baldan","year":"2001","unstructured":"P. Baldan, A. Corradini, and B. K\u00f6nig. A static analysis technique for graph transformation systems. In Proc. of CONCUR\u2019 01, pages 381\u2013395. Springer-Verlag, 2001. LNCS 2154."},{"key":"4_CR2","unstructured":"P. Baldan, A. Corradini, and B. K\u00f6nig. Static analysis of distributed systems with mobility specified by graph grammars\u2014a case study. In Proc. of IDPT\u2019 02 (World Conference on Integrated Design & Process Technology), 2002. to appear."},{"key":"4_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BFb0055061","volume-title":"Proc. of IC ALP\u201998","author":"P. Baldan","year":"1998","unstructured":"P. Baldan, A. Corradini, and U. Montanari. Concatenable graph processes: relating processes and derivation traces. In Proc. of IC ALP\u201998, volume 1443 of LNCS, pages 283\u2013295. Springer Verlag, 1998."},{"key":"4_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-49019-1_6","volume-title":"Proc. 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, Proc. of FoSSaCS\u2019 99, volume 1578 of LNCS, pages 73\u201389. Springer Verlag, 1999."},{"key":"4_CR5","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":"4_CR6","doi-asserted-by":"crossref","unstructured":"B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations, chapter 5. World Scientific, 1997.","DOI":"10.1142\/9789812384720_0005"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"P. Cousot. Abstract interpretation. ACM Computing Surveys, 28(2), 1996.","DOI":"10.1145\/234528.234740"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Formal Models and Semantics, Handbook of Theoretical Computer Science, volume B, pages 243\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"4_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025714","volume-title":"Proc. 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, Proc. 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":"4_CR10","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":"4_CR11","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"},{"issue":"2\u20133","key":"4_CR12","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":"4_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J. Esparza","year":"1997","unstructured":"J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85\u2013107, 1997.","journal-title":"Acta Informatica"},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Proc. of 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, Proc. of 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 151\u2013165. Springer Verlag, 1998."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0304-3975(91)90228-T","volume":"82","author":"R.R. Howell","year":"1991","unstructured":"R.R. Howell, L.E. Rosier, and H.-C. Yen. A taxonomy of fairness and temporal logic problems for Petri nets. Theoretical Computer Science, 82:341\u2013372, 1991.","journal-title":"Theoretical Computer Science"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(90)90006-4","volume":"74","author":"P. Jan\u010dar","year":"1990","unstructured":"P. Jan\u010dar. Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science, 74:71\u201393, 1990.","journal-title":"Theoretical Computer Science"},{"key":"4_CR17","unstructured":"N.D. Jones and F. Nielson. Abstract interpretation: a semantics-based tool for program analysis. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Vol. 4: Semantic Modelling, pages 527\u2013636. Oxford University Press, 1995."},{"key":"4_CR18","unstructured":"M. Koch. Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Systems. PhD thesis, Technische Universit\u00e4t Berlin, 2000."},{"key":"4_CR19","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":"4_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01384313","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:1\u201335, 1995.","journal-title":"Formal Methods in System Design"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"P. Manolios and R.J. Trefler. Safety and liveness in branching time. In Proc. of LICS\u2019 01, 2001.","DOI":"10.1109\/LICS.2001.932512"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"4_CR23","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"},{"issue":"5","key":"4_CR24","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/BF01211865","volume":"6","author":"A. P. Sistla","year":"1994","unstructured":"A. Prasad Sistla. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing, 6(5):495\u2013512, 1994.","journal-title":"Formal Aspects of Computing"},{"key":"4_CR25","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":"4_CR26","unstructured":"L. Ribeiro. Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universit\u00e4t Berlin, 1996."},{"key":"4_CR27","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"},{"key":"4_CR28","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\/3303"},{"key":"4_CR29","unstructured":"V. Sassone. On the Semantics of Petri Nets: Processes, Unfolding and Infinite Computations. PhD thesis, University of Pisa-Department of Computer Science, 1994."}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45832-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T05:15:36Z","timestamp":1587878136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45832-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443100","9783540458326"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-45832-8_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}