{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:05:02Z","timestamp":1725573902885},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204619"},{"type":"electronic","value":"9783540398936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39893-6_19","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T15:35:57Z","timestamp":1294414557000},"page":"319-337","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Path Finding with the Sweep-Line Method Using External Storage"],"prefix":"10.1007","author":[{"given":"Lars Michael","family":"Kristensen","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Mailund","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Design\/CPN, \n                    \n                      http:\/\/www.daimi.au.dk\/designCPN"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A Theory of Timed Automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J.: Efficient Guiding Towards Cost-Optimaility in UPPAAL. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 174\u2013188. Springer, Heidelberg (2001)"},{"issue":"8","key":"19_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/3-540-45319-9_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Christensen","year":"2001","unstructured":"Christensen, S., Kristensen, L.M., Mailund, T.: A Sweep-Line Method for State Space Exploration. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 450\u2013464. Springer, Heidelberg (2001)"},{"key":"19_CR6","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-56922-7_37","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"1993","unstructured":"Clarke, E.M., Filkorn, T., Jha, S.: Exploiting Symmetries in Temporal Logic Model Checking. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 450\u2013462. Springer, Heidelberg (1993)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BFb0035378","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E.A. Emerson","year":"1997","unstructured":"Emerson, E.A., Jha, S., Peled, D.: Combining Partial Order and Symmetry Reduction. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 35\u201349. Springer, Heidelberg (1997)"},{"issue":"1\/2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1996","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and Model Checking. Formal Methods in System Design\u00a09(1\/2), 105\u2013131 (1996)","journal-title":"Formal Methods in System Design"},{"key":"19_CR10","first-page":"280","volume-title":"Proc. of RTCSA 1999","author":"A. Fehnker","year":"1999","unstructured":"Fehnker, A.: Scheduling a Steel Plant with Timed Automata. In: Proc. of RTCSA 1999, pp. 280\u2013286. IEEE Computer Society, Los Alamitos (1999)"},{"key":"19_CR11","unstructured":"WAP Forum. WAP Wireless Transaction Protocol Specification. June 2000 Conformance Release. Available via: \n                    \n                      http:\/\/www.wapforum.org\/\n                    \n                    \n                   (February 19, 2000)"},{"key":"19_CR12","unstructured":"WAP Forum. Wireless Application Protocol. Specifications available via: \n                    \n                      http:\/\/www.wapforum.org\/"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01384077","volume":"7","author":"P. Godefroid","year":"1995","unstructured":"Godefroid, P., Holzmann, G.J., Pirottin, D.: State-Space Caching Revisited. Formal Methods in System Design\u00a07(3), 227\u2013241 (1995)","journal-title":"Formal Methods in System Design"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-48068-4_12","volume-title":"Application and Theory of Petri Nets 2002","author":"S. Gordon","year":"2002","unstructured":"Gordon, S., Kristensen, L.M., Billington, J.: Verification of a Revised WAP Wireless Transaction Protocol. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol.\u00a02360, pp. 182\u2013202. Springer, Heidelberg (2002)"},{"key":"19_CR15","first-page":"2413","volume":"64","author":"G.J. Holzmann","year":"1985","unstructured":"Holzmann, G.J.: Tracing Protocols. Bell System Technical Journal\u00a064, 2413\u20132434 (1985)","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/spe.4380180203","volume":"18","author":"G.J. Holzmann","year":"1988","unstructured":"Holzmann, G.J.: An Improved Protocol Reachability Analysis Technique. Software, Practice and Experience\u00a018(2), 137\u2013161 (1988)","journal-title":"Software, Practice and Experience"},{"key":"19_CR17","volume-title":"Design and Validation of Computer Protocols","author":"G.J. Holzmann","year":"1991","unstructured":"Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice-Hall International, Englewood Cliffs (1991)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1008696026254","volume":"13","author":"G.J. Holzmann","year":"1998","unstructured":"Holzmann, G.J.: An Analysis of Bitstate Hashing. Formal Methods in System Design\u00a013, 289\u2013307 (1998)","journal-title":"Formal Methods in System Design"},{"issue":"1\/2","key":"19_CR19","first-page":"41","volume":"9","author":"C.N. Ip","year":"1996","unstructured":"Ip, C.N., Dill, D.L.: Better Verification Through Symmetry. Formal Methods in System Design\u00a09(1\/2), 41\u201375 (1996)","journal-title":"Formal Methods in System Design"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-55179-4_19","volume-title":"Computer Aided Verification","author":"C. Jard","year":"1992","unstructured":"Jard, C., Jeron, T.: Bounded-memory Algorithms for Verification On-the-fly. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 192\u2013202. Springer, Heidelberg (1992)"},{"key":"19_CR21","series-title":"Basic Concepts","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06289-0","volume-title":"Coloured Petri Nets - Basic Concepts, Analysis Methods and Practical Use","author":"K. Jensen","year":"1992","unstructured":"Jensen, K.: Coloured Petri Nets - Basic Concepts, Analysis Methods and Practical Use. Basic Concepts, vol.\u00a01. Springer, Heidelberg (1992)"},{"issue":"1\/2","key":"19_CR22","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00625967","volume":"9","author":"K. Jensen","year":"1996","unstructured":"Jensen, K.: Condensed State Spaces for Symmetrical Coloured Petri Nets. Formal Methods in System Design\u00a09(1\/2), 7\u201340 (1996)","journal-title":"Formal Methods in System Design"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1008775109219","volume":"14","author":"S. Katz","year":"1999","unstructured":"Katz, S., Miller, H.: Saving Space by Fully Exploiting Invisible Transitions. Formal Methods in System Design\u00a014, 311\u2013332 (1999)","journal-title":"Formal Methods in System Design"},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s100090050021","volume":"2","author":"L.M. Kristensen","year":"1998","unstructured":"Kristensen, L.M., Christensen, S., Jensen, K.: The Practitioner\u2019s Guide to Coloured Petri Nets. International Journal on Software Tools for Technology Transfer\u00a02(2), 98\u2013132 (1998)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45614-7_31","volume-title":"FME 2002: Formal Methods - Getting IT Right","author":"L.M. Kristensen","year":"2002","unstructured":"Kristensen, L.M., Mailund, T.: A Generalised Sweep-Line Method for Safety Properties. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol.\u00a02391, pp. 549\u2013567. Springer, Heidelberg (2002)"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-36135-9_21","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2002","author":"L.M. Kristensen","year":"2002","unstructured":"Kristensen, L.M., Mailund, T.: A Compositional Sweep-Line State Space Exploration Method. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol.\u00a02529, pp. 327\u2013343. Springer, Heidelberg (2002)"},{"key":"19_CR27","doi-asserted-by":"crossref","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)"},{"key":"19_CR28","series-title":"Prentice-Hall International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0035380","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A.N. Parashkevov","year":"1997","unstructured":"Parashkevov, A.N., Yantchev, J.: Space Efficient Reachability Analysis through use of Pseudo-root States. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 50\u201364. Springer, Heidelberg (1997)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from One, One for All: On Model Checking Using Representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"19_CR31","series-title":"EACTS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets. EACTS Monographs on Theoretical Computer Science, vol.\u00a04. Springer, Heidelberg (1985)"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-60385-9_13","volume-title":"Correct Hardware Design and Verification Methods","author":"U. Stern","year":"1995","unstructured":"Stern, U., Dill, D.L.: Improved Probabilistic Verification by Hash Compaction. In: Camurati, P.E., Eveking, H. (eds.) CHARME 1995. LNCS, vol.\u00a0987, pp. 206\u2013224. Springer, Heidelberg (1995)"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Stern, U., Dill, D.L.: A New Scheme for Memory-Efficient Probabilistic Verification. In: Proc. of Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification, pp. 333\u2013348 (1996)","DOI":"10.1007\/978-0-387-35079-0_21"},{"key":"19_CR34","first-page":"81","volume-title":"4. GI\/ITG\/GME Workshop zur Methoden des Entwurfs und der Verifikation Digitaler Systeme","author":"U. Stern","year":"1996","unstructured":"Stern, U., Dill, D.L.: Combining State Space Caching and Hash Compaction. In: 4. GI\/ITG\/GME Workshop zur Methoden des Entwurfs und der Verifikation Digitaler Systeme, Kreischa, pp. 81\u201390. Shaker, Aachen (1996)"},{"key":"19_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/BFb0028743","volume-title":"Computer Aided Verification","author":"U. Stern","year":"1998","unstructured":"Stern, U., Dill, D.L.: Using Magnetic Disk instead of Main Memory in the Murphi Verifier. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 172\u2013183. Springer, Heidelberg (1998)"},{"key":"19_CR36","volume-title":"Elements of ML Programming","author":"J.D. Ullman","year":"1998","unstructured":"Ullman, J.D.: Elements of ML Programming. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BFb0023729","volume-title":"Computer-Aided Verification","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. In Proceedings of CAV\u201990. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol.\u00a0531, pp. 156\u2013165. Springer, Heidelberg (1991)"},{"key":"19_CR38","unstructured":"Valmari, A.: Stubborn Sets of Coloured Petri Nets. In: Rozenberg, G. (ed.) Proceedings of ICATPN 1991, pp. 102\u2013121 (1991)"},{"key":"19_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"Lectures on Petri Nets I: Basic Models","author":"A. Valmari","year":"1998","unstructured":"Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 429\u2013528. Springer, Heidelberg (1998)"},{"key":"19_CR40","unstructured":"Vardi, M., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: Proc. of IEEE Symposium on Logic in Computer Science, pp. 322\u2013331 (1986)"},{"key":"19_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-56922-7_6","volume-title":"Computer Aided Verification","author":"P. Wolper","year":"1993","unstructured":"Wolper, P., Leroy, D.: Reliable Hashing without Collision Detection. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 59\u201370. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39893-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T09:19:15Z","timestamp":1553332755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39893-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204619","9783540398936"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39893-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}