{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:27:08Z","timestamp":1768685228146,"version":"3.49.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,1,21]],"date-time":"2015-01-21T00:00:00Z","timestamp":1421798400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2015,1,21]]},"abstract":"<jats:p>The main limitation of the verification approaches based on state enumeration is the state explosion problem. The partial order reduction techniques aim at attenuating this problem by reducing the number of transitions to be fired from each state while preserving properties of interest. Among the reduction techniques proposed in the literature, this article considers the stubborn set method of Petri nets and investigates its extension to time Petri nets. It establishes some useful sufficient conditions for stubborn sets, which preserve deadlocks and k-boundedness of places.<\/jats:p>","DOI":"10.1145\/2680541","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T14:05:51Z","timestamp":1422453951000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Stubborn Sets for Time Petri Nets"],"prefix":"10.1145","volume":"14","author":[{"given":"Hanifa","family":"Boucheneb","sequence":"first","affiliation":[{"name":"Laboratoire VeriForm, Department of Computer Engineering, \u00c9cole Polytechnique de Montr\u00e9al, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamel","family":"Barkaoui","sequence":"additional","affiliation":[{"name":"Laboratoire CEDRIC, Conservatoire National des Arts et M\u00e9tiers, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,1,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.845076"},{"key":"e_1_2_1_3_1","volume-title":"9th International Conference on Concurrency Theory (CONCUR\u201998)","volume":"1466","author":"Bengtsson J."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.12.005"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.75415"},{"key":"e_1_2_1_6_1","volume-title":"9th International Conference of Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science","volume":"2619","author":"Berthomieu B."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2406336.2406343"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exp036"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.002"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38697-8_8"},{"key":"e_1_2_1_11_1","first-page":"469","article-title":"A more efficient time Petri net state space abstraction useful to model checking timed linear properties","volume":"88","author":"Boucheneb H.","year":"2008","journal-title":"Fundamenta Informaticae"},{"key":"e_1_2_1_12_1","volume-title":"9th IEEE International Workshop on Petri Nets and Performance Models. IEEE Computer Society, 219--228","author":"Boyer M."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11767589_8"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40229-6_7"},{"key":"e_1_2_1_15_1","unstructured":"D. Delfieu M. Sogbohossou L. M. Traonouez and S. Revol. 2007. Parameterized study of a time Petri net. In Cybernetics and Information Technologies Systems and Applications: CITSA. 89--90.  D. Delfieu M. Sogbohossou L. M. Traonouez and S. Revol. 2007. Parameterized study of a time Petri net. In Cybernetics and Information Technologies Systems and Applications: CITSA. 89--90."},{"key":"e_1_2_1_16_1","volume-title":"9th International Conference on Production Research. 1--6.","author":"Delgadillo G. M."},{"key":"e_1_2_1_17_1","series-title":"Lecture Notes in Computer Science","volume-title":"An Approach to the State-Explosion Problem","author":"Godefroid P."},{"key":"e_1_2_1_18_1","volume-title":"5th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS\u201907)","author":"Hakansson J."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80254-3"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.07.023"},{"key":"e_1_2_1_21_1","volume-title":"International Workshop on Synthesis and System Integration of Mixed Technologies. 1--6.","author":"Mercer E. G."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646734.701480"},{"key":"e_1_2_1_23_1","series-title":"Lecture Notes in Computer Science","volume-title":"All from one, one for all: On model checking using representatives","author":"Peled D."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00133-6"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e88-d.7.1646"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817949_31"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/240518.240530"},{"key":"e_1_2_1_28_1","volume-title":"3rd International Workshop on Design and Test (IDT\u201908)","author":"Sogbohossou M."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00709154"},{"key":"e_1_2_1_30_1","series-title":"Lecture Notes in Computer Science","volume-title":"The State Explosion Problem","author":"Valmari A."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13675-7_5"},{"key":"e_1_2_1_32_1","unstructured":"T. Yoneda and H. Ryuba. 1998. CTL model checking of time petri nets using geometric regions. IEICE - Transactions on Information and Systems. E99-D(3) (1998) 297--306.  T. Yoneda and H. Ryuba. 1998. CTL model checking of time petri nets using geometric regions. IEICE - Transactions on Information and Systems. E99-D(3) (1998) 297--306."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008682131325"},{"key":"e_1_2_1_34_1","volume-title":"Lecture Notes in Computer Science","volume":"697","author":"Yoneda T."}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2680541","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2680541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:16Z","timestamp":1750273456000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2680541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,21]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1,21]]}},"alternative-id":["10.1145\/2680541"],"URL":"https:\/\/doi.org\/10.1145\/2680541","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,21]]},"assertion":[{"value":"2013-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-01-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}