{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:01:38Z","timestamp":1746417698662,"version":"3.40.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319105116"},{"type":"electronic","value":"9783319105123"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10512-3_5","type":"book-chapter","created":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T05:20:44Z","timestamp":1407734444000},"page":"53-68","source":"Crossref","is-referenced-by-count":3,"title":["Delay-Dependent Partial Order Reduction Technique for Time Petri Nets"],"prefix":"10.1007","author":[{"given":"Hanifa","family":"Boucheneb","sequence":"first","affiliation":[]},{"given":"Kamel","family":"Barkaoui","sequence":"additional","affiliation":[]},{"given":"Karim","family":"Weslati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/43.845076","volume":"19","author":"W. Belluomini","year":"2000","unstructured":"Belluomini, W., Myers, C.J.: Timed state space exploration using POSETs. IEEE Transactions on Computer-Aided Design of Integrated Circuits\u00a019(5), 501\u2013520 (2000)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits"},{"unstructured":"Bengtsson, J.: Clocks, DBMs and States in Timed Systems. PhD thesis, Dept. of Information Technology, Uppsala University (2002)","key":"5_CR2"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J.E. Bengtsson","year":"1998","unstructured":"Bengtsson, J.E., Jonsson, B., Lilius, J., Yi, W.: Partial order reductions for timed systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 485\u2013500. Springer, Heidelberg (1998)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.12.005","volume":"474","author":"B. B\u00e9rard","year":"2013","unstructured":"B\u00e9rard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: The expressive power of time Petri nets. Theoretical Computer Science\u00a0474, 1\u201320 (2013)","journal-title":"Theoretical Computer Science"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-36577-X_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Berthomieu","year":"2003","unstructured":"Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of time Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 442\u2013457. Springer, Heidelberg (2003)"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/2406336.2406343","volume":"12","author":"H. Boucheneb","year":"2013","unstructured":"Boucheneb, H., Barkaoui, K.: Reducing interleaving semantics redundancy in reachability analysis of time Petri nets. ACM Transactions on Embedded Computing Systems (TECS)\u00a012(1), 259\u2013273 (2013)","journal-title":"ACM Transactions on Embedded Computing Systems (TECS)"},{"issue":"6","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1093\/logcom\/exp036","volume":"19","author":"H. Boucheneb","year":"2009","unstructured":"Boucheneb, H., Gardey, G., Roux, O.H.: TCTL model checking of time Petri nets. Logic and Computation\u00a019(6), 1509\u20131540 (2009)","journal-title":"Logic and Computation"},{"issue":"1-3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.tcs.2005.11.002","volume":"353","author":"H. Boucheneb","year":"2006","unstructured":"Boucheneb, H., Hadjidj, R.: CTL* model checking for time Petri nets. Theoretical Computer Science TCS\u00a0353(1-3), 208\u2013227 (2006)","journal-title":"Theoretical Computer Science TCS"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-38697-8_8","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"H. Boucheneb","year":"2013","unstructured":"Boucheneb, H., Lime, D., Roux, O.H.: On multi-enabledness in time Petri nets. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol.\u00a07927, pp. 130\u2013149. Springer, Heidelberg (2013)"},{"issue":"4","key":"5_CR10","first-page":"469","volume":"88","author":"H. Boucheneb","year":"2008","unstructured":"Boucheneb, H., Rakkay, H.: A more efficient time Petri net state space abstraction useful to model checking timed linear properties. Fundamenta Informaticae\u00a088(4), 469\u2013495 (2008)","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"crossref","unstructured":"Boyer, M., Diaz, M.: Multiple-enabledness of transitions in time Petri nets. In: 9th IEEE International Workshop on Petri Nets and Performance Models, pp. 219\u2013228 (2001)","key":"5_CR11","DOI":"10.1109\/PNPM.2001.953371"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11767589_8","volume-title":"Petri Nets and Other Models of Concurrency - ICATPN 2006","author":"T. Chatain","year":"2006","unstructured":"Chatain, T., Jard, C.: Complete finite prefixes of symbolic unfoldings of safe time Petri nets. In: Donatelli, S., Thiagarajan, P.S. (eds.) ICATPN 2006. LNCS, vol.\u00a04024, pp. 125\u2013145. Springer, Heidelberg (2006)"},{"unstructured":"Delfieu, D., Sogbohossou, M., Traonouez, L.M., Revol, S.: Parameterized study of a time Petri net. In: Cybernetics and Information Technologies, Systems and Applications: CITSA, pp. 89\u201390 (2007)","key":"5_CR13"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","author":"P. Godefroid","year":"1996","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol.\u00a01032, pp. 1\u2013142. Springer, Heidelberg (1996)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-75454-1_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J. H\u00e5kansson","year":"2007","unstructured":"H\u00e5kansson, J., Pettersson, P.: Partial order reduction for verification of real-time components. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 211\u2013226. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Lilius, J.: Efficient state space search for time Petri nets. In: MFCS Workshop on Concurrency Algorithms and Tools. ENTCS, vol.\u00a08, pp. 113\u2013133 (1998)","key":"5_CR16","DOI":"10.1016\/S1571-0661(05)80254-3"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2005.07.023","volume":"345","author":"D. Lugiez","year":"2005","unstructured":"Lugiez, D., Niebert, P., Zennou, S.: A partial order semantics approach to the clock explosion problem of timed automata. Theoretical Computer Science TCS\u00a0345(1), 27\u201359 (2005)","journal-title":"Theoretical Computer Science TCS"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-48320-9_30","volume-title":"CONCUR\u201999. Concurrency Theory","author":"M. Minea","year":"1999","unstructured":"Minea, M.: Partial order reduction for model checking of timed automata. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 431\u2013446. Springer, Heidelberg (1999)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"issue":"5","key":"5_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0020-0190(97)00133-6","volume":"63","author":"D. Peled","year":"1997","unstructured":"Peled, D., Wilke, T.: Stutter invariant temporal properties are expressible without the next-time operator. Information Processing Letters\u00a063(5), 243\u2013246 (1997)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Romulo, F., Raimundo, B., Paulo, M.: Analysis of real-time scheduling problems by single step and maximal step semantics for time petri net models. In: 3rd Brazilian Symposium on Computing Systems Engineering (SBESC), pp. 107\u2013112 (2013)","key":"5_CR21","DOI":"10.1109\/SBESC.2013.45"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11817949_31","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R.B. Salah","year":"2006","unstructured":"Salah, R.B., Bozga, M., Maler, O.: On interleaving in timed automata. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 465\u2013476. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Semenov, A., Yakovlev, A.: Verification of asynchronous circuits using time Petri net unfolding. In: 33rd Annual Conference on Design Automation (DAC), pp. 59\u201362 (1996)","key":"5_CR23","DOI":"10.1145\/240518.240530"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-13675-7_5","volume-title":"Applications and Theory of Petri Nets","author":"A. Valmari","year":"2010","unstructured":"Valmari, A., Hansen, H.: Can stubborn sets be optimal? In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol.\u00a06128, pp. 43\u201362. Springer, Heidelberg (2010)"},{"unstructured":"Yoneda, T., Ryuba, H.: CTL model checking of time Petri nets using geometric regions. EICE Trans. Inf. & Syst.\u00a0E-99D(3), 297\u2013306 (1998)","key":"5_CR25"},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1008682131325","volume":"11","author":"T. Yoneda","year":"1997","unstructured":"Yoneda, T., Schlingloff, B.H.: Efficient verification of parallel real-time systems. Formal Methods in System Design\u00a011(2), 187\u2013215 (1997)","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10512-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T03:54:59Z","timestamp":1746330899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10512-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319105116","9783319105123"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10512-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}