{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:15:40Z","timestamp":1725488140653},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646778"},{"type":"electronic","value":"9783540691082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69108-1_8","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T14:45:11Z","timestamp":1186411511000},"page":"124-143","source":"Crossref","is-referenced-by-count":1,"title":["On Stubborn Sets in the Verification of Linear Time Temporal Properties"],"prefix":"10.1007","author":[{"given":"Kimmo","family":"Varpaaniemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"8_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3-540-63139-9_38","volume-title":"Proceedings of PN\u2019 97","author":"F. Bause","year":"1997","unstructured":"Bause, F.: Analysis of Petri Nets with a Dynamic Priority Method. Az\u00e9ma, P., and Balbo, G. (Eds.), Proceedings of PN\u2019 97, Toulouse. LNCS 1248, Springer-Verlag 1997, pp. 215\u2013234."},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of CAV\u2019 93","year":"1993","unstructured":"Courcoubetis, C. (Ed.): Proceedings of CAV\u2019 93, Elounda, Greece. LNCS 697, Springer-Verlag 1993, 504 p."},{"volume-title":"Proceedings of PSTV\u2019 95","year":"1996","key":"8_CR3","unstructured":"Dembi\u0144ski, P., and \u015aredniawa, M. (Eds.): Proceedings of PSTV\u2019 95, Warsaw. Chapman & Hall 1996, 453 p."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and Modal Logic. van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Vol. B. Elsevier 1990, pp. 995\u20131072.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Francez, N.: Fairness. Springer-Verlag 1986, 295 p.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/ISTCS.1995.377038","volume-title":"Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems","author":"R. Gerth","year":"1995","unstructured":"Gerth, R., Kuiper, R., Peled, D., and Penczek, W.: A Partial Order Approach to Branching Time Logic Model Checking. Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems, Tel Aviv 1995. IEEE Computer Society Press, Los Alamitos CA 1995, pp. 130\u2013140."},{"key":"8_CR7","first-page":"3","volume-title":"Proceedings of PSTV\u2019 95","author":"R. Gerth","year":"1996","unstructured":"Gerth, R., Peled, D., Vardi, M.Y., and Wolper, P.: Simple On-the-Fly Automatic Verification of Linear Temporal Logic. In \u015aredniawa, M. (Eds.): Proceedings of PSTV\u2019 95, Warsaw. Chapman & Hall 1996 [3], pp. 3\u201318."},{"key":"8_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems \u2014 An Approach to the State-Explosion Problem","author":"P. Godefroid","year":"1996","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems \u2014 An Approach to the State-Explosion Problem. LNCS 1032, Springer-Verlag 1996, 143 p."},{"key":"8_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-56922-7_36","volume-title":"Proceedings of CAV\u2019 93","author":"P. Godefroid","year":"1993","unstructured":"Godefroid, P., and Pirottin, D.: Refining Dependencies Improves Partial-Order Verification Methods. In [2], pp. 438\u2013449."},{"key":"8_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BFb0023730","volume-title":"Proceedings of CAV\u2019 90","author":"R. Janicki","year":"1991","unstructured":"Janicki, R., and Koutny, M.: Using Optimal Simulations to Reduce Reachability Graphs. Clarke, E.M., and Kurshan, R.P. (Eds.), Proceedings of CAV\u2019 90, New Brunswick NJ. LNCS 531, Springer-Verlag 1991, pp. 166\u2013175."},{"key":"8_CR11","unstructured":"Kaivola, R.: Equivalence, Preorders and Compositional Verification for Linear Time Temporal Logic and Concurrent Systems. Doctoral thesis, University of Helsinki, Department of Computer Science, Report A-1996-1, 1996, 185 p."},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","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"},{"key":"8_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-63166-6_33","volume-title":"Proceedings of CAV\u2019 97","author":"I. Kokkarinen","year":"1997","unstructured":"Kokkarinen, I., Peled, D., and Valmari, A.: Relaxed Visibility Enhances Partial Order Reduction. Grumberg, O. (Ed.), Proceedings of CAV\u2019 97, Haifa. LNCS 1254, Springer-Verlag 1997, pp. 328\u2013339."},{"key":"8_CR14","unstructured":"Koutny, M., and Pietkiewicz-Koutny, M.: On the Sleep Sets Method for Partial Order Verification of Concurrent Systems. University of Newcastle upon Tyne, Department of Computing Science, Technical Report 495, Newcastle upon Tyne 1994."},{"key":"8_CR15","unstructured":"Overman, W.T.: Verification of Concurrent Systems: Function and Timing. PhD thesis, University of California at Los Angeles 1981, 174 p."},{"key":"8_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Proceedings of CAV\u2019 93","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from One, One for All: on Model Checking Using Representatives. In [2], pp. 409\u2013423."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00121262","volume":"8","author":"D. Peled","year":"1996","unstructured":"Peled, D.: Combining Partial Order Reductions with On-the-Fly Model-Checking. Formal Methods in System Design 8 (1996) 1, pp. 39\u201364.","journal-title":"Formal Methods in System Design"},{"key":"8_CR18","first-page":"115","volume-title":"Proceedings of PSTV\u2019 95","author":"D. Peled","year":"1996","unstructured":"Peled, D., and Penczek, W.: Using Asynchronous B\u00fcchi Automata for Efficient Automatic Verification of Concurrent Systems. In \u015aredniawa, M. (Eds.): Proceedings of PSTV\u2019 95, Warsaw. Chapman & Hall 1996 [3], pp. 115\u2013130."},{"key":"8_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/3-540-63141-0_2","volume-title":"Proceedings of CONCUR\u2019 97","author":"Y.S. Ramakrishna","year":"1997","unstructured":"Ramakrishna, Y.S., and Smolka, S.A.: Partial-Order Reduction in the Weak Modal Mu-Calculus. Mazurkiewicz, A., and Winkowski, J. (Eds.), Proceedings of CONCUR\u2019 97, Warsaw. LNCS 1243, Springer-Verlag 1997, pp. 5\u201324."},{"key":"8_CR20","unstructured":"Rauhamaa, M.: A Comparative Study of Methods for Efficient Reachability Analysis. Helsinki University of Technology, Digital Systems Laboratory Report A 14, 1990, 61 p."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag 1985, 161 p.","DOI":"10.1007\/978-3-642-69968-9"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1008629725384","volume":"11","author":"R.H. Sloan","year":"1997","unstructured":"Sloan, R.H., and Buy, U.: Stubborn Sets for Real-Time Petri Nets. Formal Methods in System Design 11 (1997) 1, pp. 23\u201340.","journal-title":"Formal Methods in System Design"},{"key":"8_CR23","doi-asserted-by":"publisher","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":"8_CR24","unstructured":"Valmari, A.: Stubborn Sets of Coloured Petri Nets. Proceedings of PN\u2019 91, Gjern, Denmark, pp. 102\u2013121."},{"key":"8_CR25","unstructured":"Valmari, A.: Alleviating State Explosion during Verification of Behavioural Equivalence. University of Helsinki, Department of Computer Science, Report A-1992-4, 1992, 57 p."},{"key":"8_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-56922-7_33","volume-title":"Proceedings of CAV\u2019 93","author":"A. Valmari","year":"1993","unstructured":"Valmari, A.: On-the-Fly Verification with Stubborn Sets. In [2], pp. 397\u2013408."},{"key":"8_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/3-540-58152-9_30","volume-title":"Proceedings of PN\u2019 94","author":"K. Varpaaniemi","year":"1994","unstructured":"Varpaaniemi, K.: On Combining the Stubborn Set Method with the Sleep Set Method. Valette, R. (Ed.), Proceedings of PN\u2019 94, Zaragoza. LNCS 815, Springer-Verlag 1994, pp. 548\u2013567."},{"key":"8_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/3-540-61363-3_28","volume-title":"Proceedings of PN\u2019 96","author":"F. Vernadat","year":"1996","unstructured":"Vernadat, F., Az\u00e9ma, P., and Michel, F.: Covering Step Graph. Billington, J., and Reisig, W. (Eds.): Proceedings of PN\u2019 96, Osaka. LNCS 1091, Springer-Verlag 1996, pp. 516\u2013535."},{"key":"8_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/3-540-56922-7_27","volume-title":"Proceedings of CAV\u2019 93","author":"T. Yoneda","year":"1993","unstructured":"Yoneda, T., Shibayama, A., Schlingloff, B.-H., and Clarke, E.M.: Efficient Verification of Parallel Real-Time Systems. In [2], pp. 321\u2013332."}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69108-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:49:21Z","timestamp":1556725761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69108-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646778","9783540691082"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-69108-1_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}