{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:15:54Z","timestamp":1742800554801},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581529"},{"type":"electronic","value":"9783540484622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58152-9_28","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:20:39Z","timestamp":1330269639000},"page":"511-530","source":"Crossref","is-referenced-by-count":3,"title":["Symbolic, symmetry, and stubborn set searches"],"prefix":"10.1007","author":[{"given":"Mikko","family":"Tiusanen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C-27","author":"S. B. Akers","year":"1978","unstructured":"S. B. Akers. Binary decision diagrams. IEEE Transactions on Computers, C-27:509\u2013516, June 1978.","journal-title":"IEEE Transactions on Computers"},{"volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency, Part I, volume 254 of Lecture Notes in Computer Science","year":"1987","unstructured":"W. Brauer, W. Reisig, and G. Rozenberg, editors. Petri Nets: Applications and Relationships to Other Models of Concurrency, Part I, volume 254 of Lecture Notes in Computer Science, Berlin, Germany, 1987. Springer-Verlag. Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course, Bad Honnef, Germany September 1986.","key":"28_CR2"},{"volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency, Part II, volume 255 of Lecture Notes in Computer Science","year":"1987","unstructured":"W. Brauer, W. Reisig, and G. Rozenberg, editors. Petri Nets: Applications and Relationships to Other Models of Concurrency, Part II, volume 255 of Lecture Notes in Computer Science, Berlin, Germany, 1987. Springer-Verlag. Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, Germany, September 1986.","key":"28_CR3"},{"issue":"6","key":"28_CR4","doi-asserted-by":"crossref","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. IEEE Transactions on Computers, C-35(6):677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"28_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R. E. Bryant","year":"1992","unstructured":"R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293\u2013318, 1992.","journal-title":"ACM Computing Surveys"},{"unstructured":"J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, Proceedings of the 1991 International Conference on Very Large Scale Integration, Aug. 1991.","key":"28_CR6"},{"unstructured":"J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. In Fifth Annual IEEE Symposium on Logic in Computer Science. IEEE, June 1990.","key":"28_CR7"},{"doi-asserted-by":"crossref","unstructured":"E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. In Courcoubetis [9], pages 450\u2013462.","key":"28_CR8","DOI":"10.1007\/3-540-56922-7_37"},{"doi-asserted-by":"crossref","unstructured":"C. Courcoubetis, editor. Computer Aided Verification, volume 697 of Lecture Notes in Computer Science. Springer-Verlag, 1993.","key":"28_CR9","DOI":"10.1007\/3-540-56922-7"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"E. W. D. Dijkstra","year":"1975","unstructured":"E. W. D. Dijkstra. Guarded commands, nondeterminacy and the formal derivation of programs. Communications of the ACM, 18:453\u2013457, Aug. 1975.","journal-title":"Communications of the ACM"},{"key":"28_CR11","first-page":"215","volume-title":"Towards Reachability Trees for High-Level Petri Nets, volume 188 of Lecture Notes in Computer Science","author":"P. Huber","year":"1985","unstructured":"P. Huber, A. M. Jensen, L. O. Jepsen, and K. Jensen. Towards Reachability Trees for High-Level Petri Nets, volume 188 of Lecture Notes in Computer Science, pages 215\u2013233. Springer-Verlag, Berlin, Germany, 1985."},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C. Y. Lee","year":"1959","unstructured":"C. Y. Lee. Representation of switching circuits by binary-decision programs. Bell Systems Technical Journal, 38:985\u2013999, July 1959.","journal-title":"Bell Systems Technical Journal"},{"unstructured":"B. Lin and A. R. Newton. Efficient symbolic manipulation of equivalence relations and classes. In Proceedings of Formal Methods in VLSI Design Workshop, Miami, FL, January 1991, 1991.","key":"28_CR13"},{"key":"28_CR14","first-page":"6","volume-title":"Implicit manipulation of equivalence classes using binary decision diagrams","author":"B. Lin","year":"1991","unstructured":"B. Lin and A. R. Newton. Implicit manipulation of equivalence classes using binary decision diagrams. In Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors, Cambridge, MA, October 14\u201316, 1991. IEEE Computer Society Press, Los Alamitos, CA 1991, 654 P., page 6, 1991."},{"issue":"4","key":"28_CR15","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541\u2013580, 1989.","journal-title":"Proceedings of the IEEE"},{"key":"28_CR16","volume-title":"PhD thesis","author":"C. A. Petri","year":"1962","unstructured":"C. A. Petri. Kommunikation mit Automaten. PhD thesis, Institut f\u00fcr Instrumentelle Mathematik, Bonn, Germany, 1962. Schriften des UM Nr. 2. English translation: [17]."},{"unstructured":"C. A. Petri. Communication with automata. Technical Report RADC-TR-65-377, Griffith Air Force Base, New York, 1966.","key":"28_CR17"},{"key":"28_CR18","first-page":"25","volume":"40","author":"K. Schmidt","year":"1991","unstructured":"K. Schmidt and P. H. Starke. An algorithm to compute the symmetries of Petri nets. Petri Net Newsletter, 40:25\u201330, Dec. 1991.","journal-title":"Petri Net Newsletter"},{"issue":"4\/5","key":"28_CR19","first-page":"293","volume":"8","author":"P. H. Starke","year":"1991","unstructured":"P. H. Starke. Reachability analysis of Petri nets using symmetries. Systeme: Analysis, Modellierung, Simulation, 8(4\/5):293\u2013303, 1991.","journal-title":"Systeme: Analysis, Modellierung, Simulation"},{"issue":"2","key":"28_CR20","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146\u2013160, 1972.","journal-title":"SIAM Journal of Computing"},{"key":"28_CR21","volume-title":"PhD thesis","author":"M. Tiusanen","year":"1993","unstructured":"M. Tiusanen. Static Analysis of Ada Tasking Programs: Models and Algorithms. PhD thesis, University of Illinois at Chicago, July 1993."},{"key":"28_CR22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1991","unstructured":"A. Valmari. Stubborn attack on state explosion. Formal Methods in System Design, 1:297\u2013322, 1991.","journal-title":"Formal Methods in System Design"},{"key":"28_CR23","first-page":"491","volume-title":"Stubborn Sets for Reduced State Space Generation, volume 483 of Lecture Notes in Computer Science","author":"A. Valmari","year":"1991","unstructured":"A. Valmari. Stubborn Sets for Reduced State Space Generation, volume 483 of Lecture Notes in Computer Science, pages 491\u2013515. Springer-Verlag, Berlin, Germany, 1991."},{"key":"28_CR24","first-page":"102","volume-title":"Stubborn sets of coloured Petri nets","author":"A. Valmari","year":"1991","unstructured":"A. Valmari. Stubborn sets of coloured Petri nets. In Papers Presented at the 12th International Conference on Application and Theory of Petri Nets, pages 102\u2013121, Gjern, Denmark, June 1991. \u00c5rhus University."},{"doi-asserted-by":"crossref","unstructured":"A. Valmari. On-the-fly verification with stubborn sets. In Courcoubetis [9], pages 397\u2013408.","key":"28_CR25","DOI":"10.1007\/3-540-56922-7_33"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58152-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:24Z","timestamp":1605647844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58152-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581529","9783540484622"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-58152-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}