{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:38:31Z","timestamp":1706060311307},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T00:00:00Z","timestamp":1513209600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada (CA)","award":["RGPIN-2016-06393"],"award-info":[{"award-number":["RGPIN-2016-06393"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11241-017-9297-0","type":"journal-article","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T06:12:42Z","timestamp":1513231962000},"page":"278-306","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Delay-dependent partial order reduction technique for real time systems"],"prefix":"10.1007","volume":"54","author":[{"given":"Hanifa","family":"Boucheneb","sequence":"first","affiliation":[]},{"given":"Kamel","family":"Barkaoui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,14]]},"reference":[{"issue":"5","key":"9297_CR1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/43.845076","volume":"19","author":"W Belluomini","year":"2000","unstructured":"Belluomini W, Myers CJ (2000) Timed state space exploration using POSETs. IEEE Trans Comput Aided Des Integrat Circuits 19(5):501\u2013520","journal-title":"IEEE Trans Comput Aided Des Integrat Circuits"},{"key":"9297_CR2","unstructured":"Bengtsson J (2002) Clocks, DBMs and states in timed systems. PhD thesis, Department of Information Technology, Uppsala University"},{"key":"9297_CR3","doi-asserted-by":"crossref","unstructured":"Bengtsson J, Jonsson B, Lilius J, Yi W (1998) Partial order reductions for timed systems. In: 9th international conference on concurrency theory (CONCUR). LNCS, vol 1466, pp 485\u2013500","DOI":"10.1007\/BFb0055643"},{"key":"9297_CR4","doi-asserted-by":"crossref","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 OH (2013) The expressive power of time Petri nets. Theor Comput Sci 474:1\u201320","journal-title":"Theor Comput Sci"},{"key":"9297_CR5","doi-asserted-by":"crossref","unstructured":"Berthomieu B, Vernadat F (2003) State class constructions for branching analysis of time Petri nets. In: 9th International conference of tools and algorithms for the construction and analysis of systems. LNCS, vol 2619, pp 442\u2013457","DOI":"10.1007\/3-540-36577-X_33"},{"issue":"1","key":"9297_CR6","first-page":"259","volume":"12","author":"H Boucheneb","year":"2013","unstructured":"Boucheneb H, Barkaoui K (2013) Reducing interleaving semantics redundancy in reachability analysis of time Petri nets. ACM Trans Embed Comput Syst (TECS) 12(1):259\u2013273","journal-title":"ACM Trans Embed Comput Syst (TECS)"},{"issue":"1","key":"9297_CR7","first-page":"11:1","volume":"14","author":"H Boucheneb","year":"2015","unstructured":"Boucheneb H, Barkaoui K (2015) Stubborn sets for time Petri nets. ACM Trans Embed Comput Syst (TECS) 14(1):11:1\u201311:25","journal-title":"ACM Trans Embed Comput Syst (TECS)"},{"key":"9297_CR8","first-page":"208227","volume":"353\/1\u20133","author":"H Boucheneb","year":"2006","unstructured":"Boucheneb H, Hadjidj R (2006) CTL* model checking for time Petri nets. Theor Comput Sci (TCS) 353\/1\u20133:208227","journal-title":"Theor Comput Sci (TCS)"},{"issue":"4","key":"9297_CR9","first-page":"469","volume":"88","author":"H Boucheneb","year":"2008","unstructured":"Boucheneb H, Rakkay H (2008) A more efficient time Petri net state space abstraction useful to model checking timed linear properties. Fundam Inf 88(4):469\u2013495","journal-title":"Fundam Inf"},{"issue":"6","key":"9297_CR10","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1093\/logcom\/exp036","volume":"19","author":"H Boucheneb","year":"2009","unstructured":"Boucheneb H, Gardey G, Roux OH (2009) TCTL model checking of time Petri nets. Logic Comput 19(6):1509\u20131540","journal-title":"Logic Comput"},{"key":"9297_CR11","doi-asserted-by":"crossref","unstructured":"Boucheneb H, Lime D, Roux OH (2013) On multi-enabledness in time Petri nets. In: 34th International conference on application and theory of Petri nets and other models of concurrency (ICATPN). LNCS, vol 7927, pp 130\u2013149","DOI":"10.1007\/978-3-642-38697-8_8"},{"key":"9297_CR12","doi-asserted-by":"crossref","unstructured":"Boucheneb H, Barkaoui K, Weslati K (2014) Delay-dependent partial order reduction technique for time Petri nets. In: 12th International conference on formal modeling and analysis of timed systems. LNCS, vol 8711, pp 53\u201368","DOI":"10.1007\/978-3-319-10512-3_5"},{"key":"9297_CR13","doi-asserted-by":"crossref","unstructured":"Boyer M, Diaz M (2001) Multiple-enabledness of transitions in time Petri nets. In: 9th IEEE international workshop on petri nets and performance models, pp 219\u2013228","DOI":"10.1109\/PNPM.2001.953371"},{"key":"9297_CR14","doi-asserted-by":"crossref","unstructured":"Chatain T, Jard C (2006) Complete finite prefixes of symbolic unfoldings of safe time Petri nets. In: 27th International conference on applications and theory of Petri nets and other models of concurrency ICATPN. LNCS, vol 4024, pp 125\u2013145","DOI":"10.1007\/11767589_8"},{"key":"9297_CR15","unstructured":"Delfieu D, Sogbohossou M, Traonouez LM, Revol S (2007) Parameterized study of a time Petri net. In: Cybernetics and information technologies, systems and applications: CITSA, pp 89\u201390"},{"key":"9297_CR16","unstructured":"Godefroid P (1996) An approach to the state-explosion problem. In: Partial-order methods for the verification of concurrent systems. LNCS, vol 1032, pp 1\u2013142"},{"key":"9297_CR17","doi-asserted-by":"crossref","unstructured":"Hakansson J, Pettersson P (2007) Partial order reduction for verification of real-time components. In: 5th international conference on formal modeling and analysis of timed systems (FORMATS). LNCS, pp 211\u2013226","DOI":"10.1007\/978-3-540-75454-1_16"},{"key":"9297_CR18","doi-asserted-by":"crossref","unstructured":"Lilius J (1998) Efficient state space search for time Petri nets. In: MFCS workshop on concurrency algorithms and tools, ENTCS, vol 8, pp 113\u2013133","DOI":"10.1016\/S1571-0661(05)80254-3"},{"issue":"1","key":"9297_CR19","doi-asserted-by":"crossref","first-page":"2759","DOI":"10.1016\/j.tcs.2005.07.023","volume":"345","author":"D Lugiez","year":"2005","unstructured":"Lugiez D, Niebert P, Zennou S (2005) A partial order semantics approach to the clock explosion problem of timed automata. Theor Comput Sci (TCS) 345(1):2759","journal-title":"Theor Comput Sci (TCS)"},{"key":"9297_CR20","doi-asserted-by":"crossref","unstructured":"Minea M (1999) Partial order reduction for model checking of timed automata. In: 10th international conference on concurrency theory (CONCUR). LNCS, vol 1664, pp 431\u2013446","DOI":"10.1007\/3-540-48320-9_30"},{"key":"9297_CR21","doi-asserted-by":"crossref","unstructured":"Peled D (1993) All from one, one for all: on model checking using representatives. In: Computer aided verification. LNCS, vol 697, pp 409\u2013423","DOI":"10.1007\/3-540-56922-7_34"},{"issue":"5","key":"9297_CR22","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0020-0190(97)00133-6","volume":"63","author":"D Peled","year":"1997","unstructured":"Peled D, Wilke T (1997) Stutter invariant temporal properties are expressible without the next-time operator. Inf Process Lett 63(5):243\u2013246","journal-title":"Inf Process Lett"},{"key":"9297_CR23","doi-asserted-by":"crossref","unstructured":"Salah RB, Bozga M, Maler O (2006) On interleaving in timed automata. In: 17th international conference on concurrency theory (CONCUR). LNCS, vol 4137, pp 465\u2013476","DOI":"10.1007\/11817949_31"},{"key":"9297_CR24","unstructured":"Semenov A, Yakovlev A (1996) Verification of asynchronous circuits using time Petri net unfolding. In: 33rd annual conference on design automation (DAC), pp 59\u201362"},{"key":"9297_CR25","doi-asserted-by":"crossref","unstructured":"Valmari A, Hansen H (2010) Can stubborn set be optimal. In: 3st International conference on application and theory of Petri nets and concurrency (Petri nets). LNCS, vol 6128, pp. 43\u201362","DOI":"10.1007\/978-3-642-13675-7_5"},{"key":"9297_CR26","first-page":"297","volume":"E99\u2013D(3)","author":"T Yoneda","year":"1998","unstructured":"Yoneda T, Ryuba H (1998) CTL model checking of time Petri nets using geometric regions. EICE Trans Inf Syst E99\u2013D(3):297\u2013306","journal-title":"EICE Trans Inf Syst"},{"issue":"2","key":"9297_CR27","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/A:1008682131325","volume":"11","author":"T Yoneda","year":"1997","unstructured":"Yoneda T, Schlingloff BH (1997) Efficient verification of parallel real-time systems. Formal Methods Syst Des 11(2):187\u2013215","journal-title":"Formal Methods Syst Des"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-017-9297-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-017-9297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-017-9297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T11:50:48Z","timestamp":1521633048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-017-9297-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,14]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9297"],"URL":"https:\/\/doi.org\/10.1007\/s11241-017-9297-0","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,14]]}}}