{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:15:55Z","timestamp":1742800555098},"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_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:20:33Z","timestamp":1330251633000},"page":"548-567","source":"Crossref","is-referenced-by-count":6,"title":["On combining the stubborn set method with the sleep set method"],"prefix":"10.1007","author":[{"given":"Kimmo","family":"Varpaaniemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"30_CR1","first-page":"17","volume-title":"Machine Intelligence 6","author":"E. Ashcroft","year":"1971","unstructured":"Ashcroft, E. and Manna, Z.: Formalization of Properties of Parallel Programs. Meltzer, B. and Michie, D. (Eds.), Machine Intelligence 6. Edinburgh University Press, Edinburgh 1971, pp. 17\u201342."},{"key":"30_CR2","unstructured":"Best, E. and Lengauer, C.: Semantic Independence. Arbeitspapiere der GMD 250, Sankt Augustin 1987, 32 p."},{"volume-title":"Lecture Notes in Computer Science 697","year":"1993","key":"30_CR3","unstructured":"Courcoubetis, C. (Ed.): Proceedings of the 5th International Conference on Computer-Aided Verification, Elounda, Greece, June\/July 1993. Lecture Notes in Computer Science 697, Springer-Verlag, Berlin 1993, 504 p."},{"key":"30_CR4","first-page":"176","volume-title":"Lecture Notes in Computer Science 531","author":"P. Godefroid","year":"1991","unstructured":"Godefroid, P.: Using Partial Orders to Improve Automatic Verification Methods. Clarke, E.M. and Kurshan, R.P. (Eds.), Proceedings of the 2nd International Workshop on Computer-Aided Verification, New Brunswick NJ, June 1990. Lecture Notes in Computer Science 531, Springer-Verlag, Berlin 1991, pp. 176\u2013185."},{"key":"30_CR5","first-page":"178","volume-title":"Lecture Notes in Computer Science 663","author":"P. Godefroid","year":"1993","unstructured":"Godefroid, P., Holzmann, G.J., and Pirottin, D.: State Space Caching Revisited. von Bochmann, G. and Probst, D.K. (Eds.), Proceedings of the 4th International Workshop on Computer-Aided Verification, Montreal, June 1992. Lecture Notes in Computer Science 663, Springer-Verlag, Berlin 1993, pp. 178\u2013191."},{"key":"30_CR6","first-page":"640","volume":"2","author":"P. Godefroid","year":"1991","unstructured":"Godefroid, P. and Kabanza, F.: An Efficient Reactive Planner for Synthesizing Reactive Plans. Proceedings of AAAI-91, Anaheim CA, July 1991, Vol. 2, pp. 640\u2013645.","journal-title":"Proceedings of AAAI-91, Anaheim CA"},{"key":"30_CR7","first-page":"438","volume-title":"Lecture Notes in Computer Science 697","author":"P. Godefroid","year":"1993","unstructured":"Godefroid, P. and Pirottin, D.: Refining Dependencies Improves Partial-Order Verification Methods."},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01383879","volume":"2","author":"P. Godefroid","year":"1993","unstructured":"Godefroid, P. and Wolper, P.: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. Formal Methods in System Design 2 (1993) 2, pp. 149\u2013164.","journal-title":"Formal Methods in System Design"},{"issue":"2","key":"30_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02252682","volume":"6","author":"S. Katz","year":"1992","unstructured":"Katz, S. and Peled, D.: Verification of Distributed Programs Using Representative Interleaving Sequences. Distributed Computing 6 (1992) 2, pp. 107\u2013120.","journal-title":"Distributed Computing"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(92)90054-J","volume":"101","author":"S. Katz","year":"1992","unstructured":"Katz, S. and Peled, D.: Defining Conditional Independence Using Collapses. Theoretical Computer Science 101 (1992) 2, pp. 337\u2013359.","journal-title":"Theoretical Computer Science"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science 255","first-page":"279","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency. Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, September 1986","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace Theory. Brauer, W., Reisig, W., and Rozenberg, G. (Eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency. Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, September 1986. Lecture Notes in Computer Science 255, Springer-Verlag, Berlin 1987, pp. 279\u2013324."},{"key":"30_CR12","volume-title":"PhD thesis","author":"W.T. Overman","year":"1981","unstructured":"Overman, W.T.: Verification of Concurrent Systems: Function and Timing. PhD thesis. University of California Los Angeles, Los Angeles CA 1981, 174 p."},{"key":"30_CR13","first-page":"409","volume-title":"Lecture Notes in Computer Science 697","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from One, One for All: on Model Checking Using Representatives. In [3], pp. 409\u2013423."},{"key":"30_CR14","volume-title":"Report A 14","author":"M. Rauhamaa","year":"1990","unstructured":"Rauhamaa, M.: A Comparative Study of Methods for Efficient Reachability Analysis. Helsinki University of Technology, Digital Systems Laboratory Report A 14, Espoo, September 1990, 61 p."},{"key":"30_CR15","volume-title":"EATCS Monographs on Theoretical Computer Science 4","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag, Berlin 1985, 161 p."},{"key":"30_CR16","unstructured":"Valmari, A.: State Space Generation: Efficiency and Practicality. Doctoral thesis, Tampere University of Technology Publications 55, Tampere 1988, 170 p."},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science 483","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn Sets for Reduced State Space Generation. Rozenberg, G. (Ed.), Advances in Petri Nets 1990. Lecture Notes in Computer Science 483, Springer-Verlag, Berlin 1991, pp. 491\u2013515."},{"issue":"4","key":"30_CR18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. Formal Methods in System Design 1 (1992) 4, pp. 297\u2013322.","journal-title":"Formal Methods in System Design"},{"key":"30_CR19","unstructured":"Valmari, A.: Stubborn Sets of Coloured Petri Nets. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark, June 1991, pp. 102\u2013121."},{"key":"30_CR20","volume-title":"Report A-1992-4","author":"A. Valmari","year":"1992","unstructured":"Valmari, A.: Alleviating State Explosion during Verification of Behavioural Equivalence. University of Helsinki, Department of Computer Science, Report A-1992-4, Helsinki 1992, 57 p."},{"key":"30_CR21","first-page":"397","volume-title":"Lecture Notes in Computer Science 697","author":"A. Valmari","year":"1993","unstructured":"Valmari, A.: On-the-Fly Verification with Stubborn Sets. In [3], pp. 397\u2013408."},{"key":"30_CR22","unstructured":"Valmari, A. and Tiusanen, M.: A Graph Model for Efficient Reachability Analysis of Description Languages. Proceedings of the 8th European Workshop on Application and Theory of Petri Nets, Zaragoza, June 1987, pp. 349\u2013366."},{"key":"30_CR23","volume-title":"Report A 26","author":"K. Varpaaniemi","year":"1993","unstructured":"Varpaaniemi, K.: Efficient Detection of Deadlocks in Petri Nets. Helsinki University of Technology, Digital Systems Laboratory Report A 26, Espoo, October 1993, 56 p."},{"key":"30_CR24","first-page":"233","volume-title":"Lecture Notes in Computer Science 715","author":"P. Wolper","year":"1993","unstructured":"Wolper, P. and Godefroid, P.: Partial-Order Methods for Temporal Verification. Best, E. (Ed.), Proceedings of the 4th International Conference on Concurrency Theory, Hildesheim, August 1993. Lecture Notes in Computer Science 715, Springer-Verlag, Berlin 1993, pp. 233\u2013246."},{"key":"30_CR25","unstructured":"Wolper, P., Godefroid, P., and Pirottin, D.: A Tutorial on Partial-Order Methods for the Verification of Concurrent Systems. Tutorial material of the 5th International Conference on Computer-Aided Verification, Elounda, Greece, June\/July 1993, 85 p."}],"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_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:11:43Z","timestamp":1619557903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58152-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581529","9783540484622"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-58152-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}