{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:51:13Z","timestamp":1742917873111,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401179"},{"type":"electronic","value":"9783540448297"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44829-2_4","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:01:40Z","timestamp":1183478500000},"page":"49-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Distributed Explicit Fair Cycle Detection (Set Based Approach)"],"prefix":"10.1007","author":[{"given":"Ivana","family":"\u010cern\u00e1","sequence":"first","affiliation":[]},{"given":"Radek","family":"Pel\u00e1nek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45139-0_13","volume-title":"Proc. SPIN Workshop on Model Checking of Software","author":"J. Barnat","year":"2001","unstructured":"J. Barnat, L. Brim, and J. St\u0159\u00edbrn\u00e1. Distributed LTL Model-Checking in SPIN. In Proc. SPIN Workshop on Model Checking of Software, volume 2057 of LNCS, pages 200\u2013216. Springer, 2001."},{"key":"4_CR2","series-title":"DSSE Technical Report","first-page":"1","volume-title":"Proc. Workshop on Verification and Computational Logic","author":"J. Barnat","year":"2002","unstructured":"J. Barnat, L. Brim, and I. \u010cern\u00e1. Property driven distribution of Nested DFS. In Proc. Workshop on Verification and Computational Logic, number DSSE-TR-2002-5 in DSSE Technical Report, pages 1\u201310. Dept. of Electronics and Computer Science, University of Southampton, UK, 2002."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"G. Behrmann. A performance study of distributed timed automata reachability analysis. In Proc. Workshop on Parallel and Distributed Model Checking, volume 68 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002.","DOI":"10.1016\/S1571-0661(05)80388-3"},{"key":"4_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-40922-X_24","volume-title":"Proc. Formal Methods in Computer-Aided Design","author":"S. Ben-David","year":"2000","unstructured":"S. Ben-David, T. Heyman, O. Grumberg, and A. Schuster. Scalable distributed on-the-fly symbolic model checking. In Proc. Formal Methods in Computer-Aided Design, volume 1954 of LNCS, pages 390\u2013404, 2000."},{"key":"4_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-48683-6_21","volume-title":"Proc. Computer-Aided Verification","author":"R. Bloem","year":"1999","unstructured":"R. Bloem, K. Ravi, and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In Proc. Computer-Aided Verification, volume 1633 of LNCS, pages 222\u2013235. Springer, 1999."},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/3-540-45319-9_37","volume-title":"Proc. Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Bollig","year":"2001","unstructured":"B. Bollig, M. Leucker, and M. Weber. Parallel model checking for the alternation free \u03bc-calculus. In Proc. Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 543\u2013558. Springer, 2001."},{"key":"4_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/BFb0031812","volume-title":"Proc. Formal Methods in Computer Aided Design","author":"R. K. Brayton","year":"1996","unstructured":"R. K. Brayton et al. VIS: a system for verification and synthesis. In Proc. Formal Methods in Computer Aided Design, volume 1166 of LNCS, pages 248\u2013256. Springer, 1996."},{"key":"4_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-45294-X_9","volume-title":"Proc. Foundations of Software Technology and Theoretical Computer Science","author":"L. Brim","year":"2001","unstructured":"L. Brim, I. \u010cern\u00e1, P. Kr\u010d\u00e1l, and R. Pel\u00e1nek. Distributed LTL model checking based on negative cycle detection. In Proc. Foundations of Software Technology and Theoretical Computer Science, volume 2245 of LNCS, pages 96\u2013107. Springer, 2001."},{"issue":"8","key":"4_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"R. E. Bryant. Graph-based algorithms for boolean function manipulation. In IEEE Transactions on Computers, volume C-35(8), pages 677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"4_CR10","unstructured":"J. R. B\u00fcchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Methodology and Philosophy Science, pages 1\u201311. Stanford university Press, 1960."},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J. R. Burch","year":"1992","unstructured":"J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142\u2013170, 1992.","journal-title":"Information and Computation"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"I. \u010cern\u00e1 and R. Pel\u00e1nek. Relating the hierarchy of temporal properties to model checking. Submitted, 2002.","DOI":"10.1007\/978-3-540-45138-9_26"},{"key":"4_CR13","unstructured":"E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 1999."},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-46017-9_18","volume-title":"Proc. SPIN Workshop on Model Checking of Software","author":"C. Eisner","year":"2002","unstructured":"C. Eisner and D. Peled. Comparing symbolic and explicit model checking of a software system. In Proc. SPIN Workshop on Model Checking of Software, volume 2318 of LNCS, page 230\u2013239. Springer, 2002."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","volume":"8","author":"E. A. Emerson","year":"1987","unstructured":"E. A. Emerson and C.-L. Lei. Modalities for model checking: branching time logic strikes back. Science of Computer Programming, 8:275\u2013306, 1987.","journal-title":"Science of Computer Programming"},{"key":"4_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-45319-9_29","volume-title":"Proc. Tools and Algorithms for Construction and Analysis of Systems","author":"K. Fisler","year":"2001","unstructured":"K. Fisler, R. Fraer, G. Kamhi Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In Proc. Tools and Algorithms for Construction and Analysis of Systems, volume 2031 of LNCS, pages 420\u2013434. Springer, 2001."},{"key":"4_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-45139-0_14","volume-title":"Proc. SPIN Workshop on Model Checking of Software","author":"H. Garavel","year":"2001","unstructured":"H. Garavel, R. Mateescu, and I. Smarandache. Parallel state space construction for model-checking. In Proc. SPIN Workshop on Model Checking of Software, volume 2057 of LNCS, pages 215+. Springer, 2001."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. Protocol Specification Testing and Verification, pages 3\u201318. Chapman & Hall, 1995.","DOI":"10.1007\/978-0-387-34892-6_1"},{"key":"4_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/3-540-61474-5_94","volume-title":"Proc Conference on Computer Aided Verification","author":"R. H. Hardin","year":"1996","unstructured":"R. H. Hardin, A. Harel, and R. P. Kurshan. COSPAN. In Proc Conference on Computer Aided Verification, volume 1102 of LNCS, pages 423\u2013427. Springer, 1996."},{"key":"4_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/10722167_6","volume-title":"Proc. Conference on Computer Aided Verification","author":"T. Heyman","year":"2000","unstructured":"T. Heyman, D. Geist, O. Grumberg, and A. Schuster. Achieving scalability in parallel reachability analysis of very large circuits. In Proc. Conference on Computer Aided Verification, volume 1855 of LNCS, pages 20\u201335. Springer, 2000."},{"key":"4_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-56922-7_5","volume-title":"Proc. Conference on Computer Aided Verification","author":"R. Hojati","year":"1993","unstructured":"R. Hojati, R. K. Brayton, and R. P. Kurshan. BDD-based debugging using language containment and fair CTL. In Proc. Conference on Computer Aided Verification, volume 697 of LNCS, pages 41\u201358. Springer, 1993."},{"issue":"5","key":"4_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G. J. Holzmann","year":"1997","unstructured":"G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279\u2013295, 1997.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"G. J. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. In Proc. SPIN Workshop on Model Checking of Software, pages 23\u201332. American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/032\/03"},{"key":"4_CR24","unstructured":"A. J. Hu. Techniques for efficient formal verification using binary decision diagrams. PhD thesis, Stanford University, 1995."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"A. J. Hu, G. York, and D. L. Dill. New techniques for efficient verification with implicitly conjoined BDDs. In Proc. Design automation Conference, pages 276\u2013282, 1994.","DOI":"10.1145\/196244.196377"},{"key":"4_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0055036","volume-title":"Proc. Automata, Languages and Programming","author":"Y. Kesten","year":"1998","unstructured":"Y. Kesten, A Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. In Proc. Automata, Languages and Programming, volume 1443 of LNCS, pages 1\u201316. Springer, 1998."},{"key":"4_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BFb0054182","volume-title":"Tools and Algorithms for Construction and Analysis of Systems","author":"R. Kurshan","year":"1998","unstructured":"R. Kurshan, V. Levin, M. Minea, D. Peled, and H. Yenig\u00fcn. Static partial order reduction. In Tools and Algorithms for Construction and Analysis of Systems, volume 1384 of LNCS, pages 345\u2013357. Springer."},{"key":"4_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48234-2_3","volume-title":"Proc. SPIN Workshop on Model Checking of Software","author":"F. Lerda","year":"1999","unstructured":"F. Lerda and R. Sisto. Distributed-memory model checking with SPIN. In Proc. SPIN Workshop on Model Checking of Software, volume 1680 of LNCS, Berlin, Germany, 1999. Springer."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publisher, 1994.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"4_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-40922-X_10","volume-title":"Proc. Formal Methods in Computer-Aided Design","author":"K. Ravi","year":"2000","unstructured":"K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In Proc. Formal Methods in Computer-Aided Design, volume 1954 of LNCS, pages 143\u2013160. Springer, 2000."},{"issue":"5","key":"4_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"J. H. Reif","year":"1985","unstructured":"J. H. Reif. Depth-first search is inherrently sequential. Information Processing Letters, 20(5):229\u2013234, 1985.","journal-title":"Information Processing Letters"},{"key":"4_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/10722167_21","volume-title":"Proc. Computer Aided Verification","author":"F. Somenzi","year":"2000","unstructured":"F. Somenzi and R. Bloem. Efficient B\u00fcchi automata from LTL formulae. In Proc. Computer Aided Verification, volume 1855 of LNCS, pages 248\u2013263. Springer, 2000."},{"key":"4_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-63166-6_26","volume-title":"Proc. Computer Aided Verification","author":"U. Stern","year":"1997","unstructured":"U. Stern and D. L. Dill. Parallelizing the Mur\u03d5 verifier. In Proc. Computer Aided Verification, volume 1254 of LNCS, pages 256\u2013267. Springer, 1997."},{"issue":"1\u20132","key":"4_CR34","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"J. R. Streett","year":"1982","unstructured":"J. R. Streett. Propositional dynamic logic of looping and converse is elementarily decidable. Information and Control, 54(1\u20132):121\u2013141, 1982.","journal-title":"Information and Control"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on computing, pages 146\u2013160, 1972.","DOI":"10.1137\/0201010"},{"key":"4_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency: Structure versus Automata","author":"M. Y. Vardi","year":"1996","unstructured":"M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, volume 1043 of LNCS, pages 238\u2013266. Springer, 1996."}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44829-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:02:18Z","timestamp":1737172938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-44829-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401179","9783540448297"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-44829-2_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"15 April 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}