{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:27Z","timestamp":1761610407594,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80293-2","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"25-41","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding"],"prefix":"10.1016","volume":"27","author":[{"given":"Rom","family":"Langerak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80293-2_BIBBB87","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","article-title":"Introduction to the ISO specification language LOTOS","volume":"14","author":"Bolognesi","year":"1987","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBBC94","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1006\/inco.1994.1088","article-title":"Flow models of distributed computations: three equivalent semantics for CCS","volume":"114","author":"Boudol","year":"1994","journal-title":"Information and Computation"},{"issue":"9\/10","key":"10.1016\/S1571-0661(05)80293-2_BIBBKLL98","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/S0169-7552(97)00134-7","article-title":"Partial-order models for quantitative extensions of LOTOS","volume":"30","author":"Brinksma","year":"1998","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBENG91","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF01463946","article-title":"Branching processes of Petri nets","volume":"28","author":"Engelfriet","year":"1991","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBERV97","series-title":"Proc. TACAS '96, volume 1055 of Lecture Notes in Computer Science","first-page":"87","article-title":"An improvement of McMillan's unfolding algorithm","author":"Esparza","year":"1997"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBESP94","doi-asserted-by":"crossref","unstructured":"J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2):151\u2013195, 1994. Also appeared in Proc. TAPSOFT '93, volume 668 of Lecture Notes in Computer Science, pages 613\u2013628. Springer-Verlag, 1993.","DOI":"10.1016\/0167-6423(94)00019-0"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBGRA97","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BFb0058040","article-title":"Computing reachability properties hidden in finite net unfoldings","volume":"1055","author":"Graves","year":"1997","journal-title":"Lecture Notes in Computer Science"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/S1571-0661(05)80293-2_BIBHOA85"},{"issue":"2","key":"10.1016\/S1571-0661(05)80293-2_KLL98","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1023\/A:1008649927166","article-title":"A consistent causality-based view on a timed process algebra including urgent interactions","volume":"12","author":"Katoen, D. Latella, R. Langerak","year":"1998","journal-title":"Journal on Formal Methods for System Design"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBLAN92","series-title":"PhD thesis, University of Twente","article-title":"Transformations and Semantics for LOTOS","author":"Langerak","year":"1992"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBLB99","doi-asserted-by":"crossref","unstructured":"R. Langerak and E. Brinksma. A complete finite prefix for process algebra. In Proceedings of CAV'99, 1999. Accepted for publication.","DOI":"10.1007\/3-540-48683-6_18"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBMCM92","first-page":"164","article-title":"Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits","author":"McMillan","year":"1992","journal-title":"Proc. CAV '92, Fourth Workshop on Computer-Aided Verification, volume 663 of Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBMCM95A","series-title":"Proc. CAV '95, 7th International Conference on Computer-Aided Verification, volume 939 of Lecture Notes in Computer-Science","first-page":"180","article-title":"Trace theoretic verification of asynchronous circuits using unfoldings","author":"McMillan","year":"1995"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBMCM95B","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01384314","article-title":"A technique of state space search based on unfolding","volume":"6","author":"McMillan","year":"1995","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"10.1016\/S1571-0661(05)80293-2_BIBNPW81","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","article-title":"Petri nets, event structures and domains, part 1","volume":"13","author":"Nielsen","year":"1981","journal-title":"Theoretical Computer Science"},{"year":"1991","series-title":"Nets, terms and formulas","author":"Olderog","key":"10.1016\/S1571-0661(05)80293-2_BIBOLD91"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBQJ96","article-title":"Finitely representing infinite reachability graphs of cfsms with graph grammars","author":"Quemener","year":"1996","journal-title":"Publication Interne 994, IRISA, Rennes, France"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBUK97","series-title":"Formal Description Techniques and Protocol Specification, Testing and Verification","first-page":"7","article-title":"Specification-based testing of concurrent systems","author":"Ulrich","year":"1997"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBWAL98","doi-asserted-by":"crossref","unstructured":"F. Wallner. Model-checking LTL using net unfoldings. In Proc. CAV '98, 10th International Conference on Computer-Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 207-218, Vancouver, Canada, 1998.","DOI":"10.1007\/BFb0028746"},{"key":"10.1016\/S1571-0661(05)80293-2_BIBWIN89","series-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science","first-page":"364","article-title":"An introduction to event structures","author":"Winskel","year":"1989"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802932?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802932?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:48Z","timestamp":1761610068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":20,"alternative-id":["S1571066105802932"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80293-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80293-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}