{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T10:56:31Z","timestamp":1790938591321,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540229407","type":"print"},{"value":"9783540286448","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28644-8_6","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T19:48:13Z","timestamp":1267127293000},"page":"83-98","source":"Crossref","is-referenced-by-count":32,"title":["Verifying Finite-State Graph Grammars: An Unfolding-Based Approach"],"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"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","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":"6_CR2","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: An unfolding-based approach for the verification of finite-state graph grammars. Technical report, Dipartimento di Informatica, Universit\u00e0 Ca\u2019 Foscari di Venezia (to appear, 2004)"},{"key":"6_CR3","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)"},{"issue":"1","key":"6_CR4","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":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44898-5_14","volume-title":"Static Analysis","author":"P. Baldan","year":"2003","unstructured":"Baldan, P., K\u00f6nig, B., K\u00f6nig, B.: A logic for analyzing abstractions of graph transformation systems. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 255\u2013272. Springer, Heidelberg (2003)"},{"key":"6_CR6","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":"6_CR7","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation. Foundations","author":"A. Corradini","year":"1997","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, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"6_CR8","series-title":"Foundations","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"6_CR9","series-title":"Concurrency, Parallelism and Distribution","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","year":"1999","unstructured":"Ehrig, H., Kreowski, J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism and Distribution, vol.\u00a03. World Scientific, Singapore (1999)"},{"issue":"2\u20133","key":"6_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: Model checking using net unfoldings. Science of Computer Programming\u00a023(2\u20133), 151\u2013195 (1994)","journal-title":"Science of Computer Programming"},{"issue":"20","key":"6_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Formal Methods in System Design\u00a020(20), 285\u2013310 (2002)","journal-title":"Formal Methods in System Design"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-46464-8_22","volume-title":"Theory and Application of Graph Transformations","author":"F. Gadducci","year":"2000","unstructured":"Gadducci, F., Heckel, R., Koch, M.: A fully abstract model for graph-interpreted temporal logic. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 310\u2013322. Springer, Heidelberg (2000)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BFb0053588","volume-title":"Fundamental Approaches to Software Engineering","author":"R. Heckel","year":"1998","unstructured":"Heckel, R.: Compositional verification of reactive systems specified by graph transformation. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol.\u00a01382, pp. 138\u2013153. Springer, Heidelberg (1998)"},{"issue":"5","key":"6_CR14","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker SPIN. IEEE Trans. on Software Engineering\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44450-5_30","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"B. K\u00f6nig","year":"2000","unstructured":"K\u00f6nig, B.: A general framework for types in graph rewriting. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 373\u2013384. Springer, Heidelberg (2000)"},{"key":"6_CR16","unstructured":"Langerak, R.: Transformation and Semantics for LOTOS. PhD thesis, Department of Computer Science, University of Twente (1992)"},{"key":"6_CR17","doi-asserted-by":"publisher","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 Academic Publishers, Dordrecht (1993)"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0304-3975(94)00174-H","volume":"138","author":"G.M. Pinna","year":"1995","unstructured":"Pinna, G.M., Poign\u00e9, A.: On the nature of events: another perspective in concurrency. Theoretical Computer Science\u00a0138(2), 425\u2013454 (1995)","journal-title":"Theoretical Computer Science"},{"key":"6_CR19","unstructured":"Rensink, A.: Towards model checking graph grammars. In: Proc. of the 3rd Workshop on Automated Verification of Critical Systems, Technical Report DSSE\u2013TR\u20132003\u20132, pp. 150\u2013160. University of Southampton (2003)"},{"key":"6_CR20","unstructured":"Ribeiro, L.: Parallel Composition and Unfolding Semantics of Graph Grammars. PhD thesis, Technische Universit\u00e4t Berlin (1996)"},{"key":"6_CR21","series-title":"Electronic Notes in Computer Science","first-page":"57","volume-title":"Proc. GT-VMT 2002: International Workshop on Graph Transformation and Visual Modelling Techniques","author":"D. Varr\u00f3","year":"1979","unstructured":"Varr\u00f3, D.: Towards symbolic analysis of visual modelling languages. In: EUROSAM 1979 and ISSAC 1979. Electronic Notes in Computer Science, vol.\u00a072.3, pp. 57\u201370. Elsevier, Amsterdam (1979)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 Petrinets. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 538\u2013548. Springer, Heidelberg (1997)"},{"key":"6_CR23","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)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2004 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28644-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T17:02:27Z","timestamp":1590685347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28644-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229407","9783540286448"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28644-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}