{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:53:33Z","timestamp":1778298813841,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662020","type":"print"},{"value":"9783540486831","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48683-6_18","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T23:22:18Z","timestamp":1191712938000},"page":"184-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A Complete Finite Prefix for Process Algebra"],"prefix":"10.1007","author":[{"given":"Rom","family":"Langerak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Brinksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","volume":"14","author":"T. Bolognesi","year":"1987","unstructured":"T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25\u201359, 1987.","journal-title":"Computer Networks and ISDN Systems"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/inco.1994.1088","volume":"114","author":"G. Boudol","year":"1994","unstructured":"G. Boudol and I. Castellani. Flow models of distributed computations: three equivalent semantics for CCS. Information and Computation, 114:247\u2013314, 1994.","journal-title":"Information and Computation"},{"issue":"9\/10","key":"18_CR3","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1016\/S0169-7552(97)00134-7","volume":"30","author":"E. Brinksma","year":"1998","unstructured":"E. Brinksma, J.-P. Katoen, D. Latella, and R. Langerak. Partial-order models for quantitative extensions of LOTOS. Computer Networks and ISDN Systems, 30(9\/10):925\u2013950, 1998.","journal-title":"Computer Networks and ISDN Systems"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"18_CR5","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"},{"key":"18_CR6","first-page":"87","volume":"1055","author":"J. Esparza","year":"1997","unstructured":"J. Esparza, S. R\u00f6mer, and W. Vogler. An improvement of McMillan\u2019s unfolding algorithm. In Proc. TACAS\u2019 96, volume 1055 of Lecture Notes in Computer Science, pages 87\u2013106. Springer-Verlag, 1997.","journal-title":"Proc. TACAS\u2019 96"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","first-page":"151","volume-title":"Science of Computer Programming","author":"J. Esparza","year":"1994","unstructured":"J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2):151\u2013195, 1994. Also appeared in Proc. TAPSOFT\u2019 93, volume 668 of Lecture Notes in Computer Science, pages 613-628. Springer-Verlag, 1993."},{"key":"18_CR8","unstructured":"A. Fantechi, S. Gnesi, and G. Mazzarini. The expressive power of LOTOS behaviour expressions. Nota Interna I.E.I. B4-43, I.E.I (Pisa), October 1992."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"B. Graves. Computing reachability properties hidden in finite net unfoldings. Lecture Notes in Computer Science, 1055:327\u2013342, 1997.","DOI":"10.1007\/BFb0058040"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1023\/A:1008649927166","volume":"12","author":"[. J.-P. Katoen","year":"1998","unstructured":"[KLL+98]_ J.-P. Katoen, D. Latella, R. Langerak, E. Brinksma, and T. Bolognesi. A consistent causality-based view on a timed process algebra including urgent interactions. Journal on Formal Methods for System Design, 12(2):189\u2013216, 1998.","journal-title":"Journal on Formal Methods for System Design"},{"key":"18_CR12","unstructured":"R. Langerak. Transformations and Semantics for LOTOS. PhD thesis, University of Twente, 1992."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"R. Langerak and E. Brinksma. A complete finite prefix for process algebra. Technical report, University of Twente, January 1999.","DOI":"10.1007\/3-540-48683-6_18"},{"key":"18_CR14","first-page":"164","volume":"663","author":"K. McMillan","year":"1992","unstructured":"K. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In Proc. CAV\u2019 92, Fourth Workshop on Computer-Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 164\u2013174, 1992.","journal-title":"Proc. CAV\u2019 92, Fourth Workshop on Computer-Aided Verification"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-60045-0_50","volume":"939","author":"K. McMillan","year":"1995","unstructured":"K. McMillan. Trace theoretic verification of asynchronous circuits using unfoldings. In Proc. CAV\u2019 95, 7th International Conference on Computer-Aided Verification, volume 939 of Lecture Notes in Computer Science, pages 180\u2013195. Springer-Verlag, 1995.","journal-title":"Proc. CAV\u2019 95, 7th International Conference on Computer-Aided Verification"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"K.L. McMillan","year":"1995","unstructured":"K.L. McMillan. A technique of state space search based on unfolding. Formal Methods in System Design, 6:45\u201365, 1995.","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"18_CR17","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.D. Plotkin, and G. Winskel. Petri nets, event structures and domains, part 1. Theoretical Computer Science, 13(1):85\u2013108, 1981.","journal-title":"Theoretical Computer Science"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"E.-R. Olderog. Nets, terms and formulas. Cambridge University Press, 1991.","DOI":"10.1017\/CBO9780511526589"},{"key":"18_CR19","first-page":"207","volume":"1427","author":"F. Wallner","year":"1998","unstructured":"F. Wallner. Model-checking LTL using net unfoldings. In Proc. CAV\u2019 98, 10th International Conference on Computer-Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 207\u2013218, Vancouver, Canada, 1998.","journal-title":"Proc. CAV\u2019 98, 10th International Conference on Computer-Aided Verification"},{"key":"18_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/BFb0013026","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G. Winskel","year":"1989","unstructured":"G. Winskel. An introduction to event structures. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science, pages 364\u2013397. Springer-Verlag, 1989."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48683-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T06:12:00Z","timestamp":1684044720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48683-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662020","9783540486831"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48683-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}