{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:57:50Z","timestamp":1777640270274,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001416","type":"print"},{"value":"9783540361350","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36135-9_22","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T02:43:21Z","timestamp":1180665801000},"page":"344-359","source":"Crossref","is-referenced-by-count":9,"title":["On Combining the Persistent Sets Method with the Covering Steps Graph Method"],"prefix":"10.1007","author":[{"given":"Pierre-Olivier","family":"Ribet","sequence":"first","affiliation":[]},{"given":"Fran","family":"\u00e7ois","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Berthomieu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,5]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-48320-9_14","volume-title":"Reachability analysis of (timed) petri nets using real arithmetic","author":"B. B\u00e9rard","year":"1999","unstructured":"B. B\u00e9rard and L. Fribourg. Reachability analysis of (timed) petri nets using real arithmetic. In Proceedings of CONCUR\u201999, pages 178\u2013193. Springer Verlag, LNCS 1664, 1999."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"J. C. Corbett. Evaluating deadlock detection methods for concurrent software. IEEE Transactions on software engineering, VOL. 22(NO. 3), March 1996.","DOI":"10.1109\/32.489078"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1109\/70.650158","volume":"13","author":"F. Chu","year":"1997","unstructured":"F. Chu and X. Xie. Deadlock analysis of petri nets using siphons and mathematical programming. In IEEE Trans. on Robotics and Automation, volume 13, pages 793\u2013804, 1997.","journal-title":"IEEE Trans. on Robotics and Automation"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"P. Godefroid. Using partial orders to improve automatic verification methods. In Proceedings of CAV\u201990, pages 321\u2013340. ACM, DIMACS volume 3, 1990.","DOI":"10.1090\/dimacs\/003\/21"},{"key":"22_CR5","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","author":"P. Godefroid","year":"1996","unstructured":"P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems. Springer Verlag, LNCS 1032, 1996."},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Refining dependencies improves partial-order verification methods","author":"P. Godefroid","year":"1993","unstructured":"P. Godefroid and D. Pirottin. Refining dependencies improves partial-order verification methods. In Proceedings of CAV\u201993. Springer Verlag, LNCS 697, 1993."},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01383879","volume":"2","author":"P. Godefroid","year":"1993","unstructured":"P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Metho ds in System Design, 2(2):149\u2013164, 1993.","journal-title":"Formal Metho ds in System Design"},{"key":"22_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/BFb0046842","volume-title":"Petri Nets: CentralMo deland Their Properties","author":"K. Jensen","year":"1986","unstructured":"K. Jensen. Couloured petrinets. In Petri Nets: CentralMo deland Their Properties, pages 248\u2013299. Springer-Verlag, LNCS 254, 1986."},{"key":"22_CR9","series-title":"Lect Notes Comput Sci","first-page":"279","volume-title":"Petri Nets: Applications and Relationships to Other Model of Concurrency, Advances in Petri nets 1986, Part II","author":"A. Mazurkiewicz","year":"1986","unstructured":"A. Mazurkiewicz. Trace theory. In Petri Nets: Applications and Relationships to Other Model of Concurrency, Advances in Petri nets 1986, Part II; Proceedings of an advanced Course, pages 279\u2013324. Springer Verlag, LNCS 255, 1986."},{"key":"22_CR10","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"22_CR11","unstructured":"M. Naimi and M. Trehel. An improvement of the logN distributed algorithm for mutual exclusion. In Proceedings of ICDCS\u201987, pages 371\u2013377, Washington, D.C., USA, September 1987. IEEE Computer Society Press."},{"key":"22_CR12","unstructured":"W. T. Overman. Verification of concurrent systems: function and timing. PhD thesis, University of California, 1981."},{"key":"22_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"All from one, one for all: On model checking using representatives","author":"D. Peled","year":"1993","unstructured":"D. Peled. All from one, one for all: On model checking using representatives. In Proceedings of CAV\u201993, pages 409\u2013423. Springer Verlag, LNCS 697, 1993."},{"key":"22_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BFb0028727","volume-title":"Ten years of partial order reduction","author":"D. Peled","year":"1998","unstructured":"Doron Peled. Ten years of partial order reduction. In Proceedings of CAV\u201998, pages 17\u201328. Springer Verlag, LNCS 1427, 1998."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"D. H. Pitt and D. Freestone. The derivation of conformance tests from lotos specifications. IEEE Transactions on Software Engineering, 1990.","DOI":"10.1109\/32.62442"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"W. Reisig. Petri Nets: an Introduction. Springer-Verlag, EATCS, 1985.","DOI":"10.1007\/978-3-642-69968-9"},{"key":"22_CR17","series-title":"Lect Notes Comput Sci","volume-title":"Error detection by reduced reachability graph generation","author":"A. Valmari","year":"1988","unstructured":"A. Valmari. Error detection by reduced reachability graph generation. In Proceedings of ATPN\u201988. Springer Verlag, LNCS 424, 1988."},{"key":"22_CR18","unstructured":"A. Valmari. State Space Generation: Efficiency and Practicality. PhD thesis, Tampere University of Technology, 1988."},{"key":"22_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Stubborn sets for reduced state space generation","author":"A. Valmari","year":"1989","unstructured":"A. Valmari. Stubborn sets for reduced state space generation. In Proceedings of ATPN\u201989. Springer Verlag, LNCS 483, 1989."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"A. Valmari. A stubborn attack on state explosion. In Proceedings of CAV\u201990, pages 25\u201342. ACM, DIMACS volume 3, 1990.","DOI":"10.1090\/dimacs\/003\/04"},{"key":"22_CR21","series-title":"Lect Notes Comput Sci","volume-title":"Covering step graph","author":"F. Vernadat","year":"1996","unstructured":"F. Vernadat, P. Az\u00e9ma, and F. Michel. Covering step graph. In Proceedings of ATPN\u201996. Springer Verlag, LNCS 1091, 1996."},{"key":"22_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Covering step graph preserving failure semantics","author":"F. Vernadat","year":"1997","unstructured":"F. Vernadat and F. Michel. Covering step graph preserving failure semantics. In Proceedings of ATPN\u201997. Springer Verlag, LNCS 1248, 1997."},{"key":"22_CR23","series-title":"Lect Notes Comput Sci","volume-title":"Partial-order methods for temporal verification","author":"P. Wolper","year":"1993","unstructured":"P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proceedings of CONCUR\u201993. Springer Verlag, LNCS 575, 1993."},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"M.C. Zhou, F. Dicesare, and A.A. Desrochers. A hybrid methodology for synthesis of petri net models for manufacturing systems. In IEEE Trans. on Robotics and Automation 8:3, pages 350\u2013361, 1993.","DOI":"10.1109\/70.143353"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Sytems \u2014 FORTE 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36135-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:17:45Z","timestamp":1556464665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36135-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001416","9783540361350"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-36135-9_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}