{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:53:49Z","timestamp":1742799229927},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001416"},{"type":"electronic","value":"9783540361350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36135-9_21","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T02:43:21Z","timestamp":1180665801000},"page":"327-343","source":"Crossref","is-referenced-by-count":4,"title":["A Compositional Sweep-Line State Space Exploration Method"],"prefix":"10.1007","author":[{"given":"Lars","family":"Michael Kristensen","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Mailund","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,5]]},"reference":[{"key":"21_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-45319-9_31","volume-title":"A Sweep-Line Method for State Space Exploration","author":"S. Christensen","year":"2001","unstructured":"S. Christensen, L.M. Kristensen, and T. Mailund. A Sweep-Line Method for State Space Exploration. In Proc. of TACAS\u201901, volume 2031 of LNCS, pages 450\u2013464. Springer-Verlag, 2001."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"E. M. Clarke, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. In Proc. of CAV\u201993, pages 450\u2013462. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56922-7_37"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","first-page":"178","volume-title":"State Space Caching Revisited","author":"P. Godefroid","year":"1992","unstructured":"P. Godefroid, G.J. Holzman, and D. Pirottin. State Space Caching Revisited. In Proc. of CAV\u201992, volume 663 of LNCS, pages 178\u2013191. Springer-Verlag, 1992."},{"key":"21_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-48068-4_12","volume-title":"Verification of a Revised WAP Wireless Transaction Protocol","author":"S. Gordon","year":"2002","unstructured":"S. Gordon, L.M. Kristensen, and J. Billington. Verification of a Revised WAP Wireless Transaction Protocol. In Proc. of ICATPN\u201902, volume 2360 of LNCS, pages 182\u2013202. Springer-Verlag, 2002."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"C.A.R Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"21_CR6","unstructured":"G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International Editions, 1991."},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","first-page":"192","volume-title":"Bounded-memory Algorithms for Verification On-the-fly","author":"C. Jard","year":"1991","unstructured":"C. Jard and T. Jeron. Bounded-memory Algorithms for Verification On-the-fly. In Proc. of CAV\u201991, volume 575 of LNCS, pages 192\u2013202. Springer-Verlag, 1991."},{"key":"21_CR8","unstructured":"L.M. Kristensen and T. Mailund. A Compositional Sweep-Line State Space Exploration Method. Technical report, Department of Computer Science, University of Aarhus, 2002. Available via: http:\/\/www.daimi.au.dk\/~mailund\/ps\/lmktm_compo.ps ."},{"key":"21_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-45614-7_31","volume-title":"A Generalised Sweep-Line Method for Safety Properties","author":"L.M. Kristensen","year":"2002","unstructured":"L.M. Kristensen and T. Mailund. A Generalised Sweep-Line Method for Safety Properties. In Proc. of FME\u201902, volume 2391 of LNCS, pages 549\u2013567. Springer-Verlag, 2002."},{"issue":"1+2","key":"21_CR10","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. International Journal on Software Tools for Technology Transfer, 1(1+2):134\u2013152, October 1997.","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"21_CR11","unstructured":"T. Mailund. SweepChecker. http:\/\/sweepchecker.sourceforge.net ."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"21_CR13","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International Series in Computer Science. Prentice-Hall, 1989."},{"key":"21_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"All from One, One for All: On Model Checking Using Representatives","author":"D. Peled","year":"1993","unstructured":"D. Peled. All from One, One for All: On Model Checking Using Representatives. In Proc. of CAV\u201993, volume 697 of LNCS, pages 409\u2013423. Springer-Verlag, 1993."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM Journal of Computing, 1(2):146\u2013160, 1972.","journal-title":"SIAM Journal of Computing"},{"key":"21_CR16","series-title":"Lect Notes Comput Sci","first-page":"491","volume-title":"Advances in Petri Nets\u2019 90","author":"A. Valmari","year":"1990","unstructured":"A. Valmari. Stubborn Sets for Reduced State Space Generation. In Advances in Petri Nets\u2019 90, volume 483 of LNCS, pages 491\u2013515. Springer-Verlag, 1990."},{"key":"21_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-61363-3_3","volume-title":"Compositionality in State Space Verification Methods","author":"A. Valmari","year":"1996","unstructured":"A. Valmari. Compositionality in State Space Verification Methods. In Proc. of ICATPN\u201996, volume 1091 of LNCS, pages 29\u201356. Springer-Verlag, 1996."},{"key":"21_CR18","unstructured":"M. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verifcation. In Proc. of IEEE Symposium on Logic in Computer Science, pages 322\u2013331, 1986."},{"key":"21_CR19","series-title":"715","first-page":"233","volume-title":"Partial Order Methods for Temporal Verification","author":"P. Wolper","year":"1993","unstructured":"P. Wolper and P. Godefroid. Partial Order Methods for Temporal Verification. In Proc. of CONCUR\u201993, volume 715 of LNCS, pages 233\u2013246. Springer-Verlag, 1993."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Sytems \u2014 FORTE 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36135-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T03:44:56Z","timestamp":1683863096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36135-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001416","9783540361350"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36135-9_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}