{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:29Z","timestamp":1740099149134,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030001506"},{"type":"electronic","value":"9783030001513"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00151-3_7","type":"book-chapter","created":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T09:54:31Z","timestamp":1535190871000},"page":"108-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Persistency in Time Petri Nets"],"prefix":"10.1007","author":[{"given":"Kamel","family":"Barkaoui","sequence":"first","affiliation":[]},{"given":"Hanifa","family":"Boucheneb","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,26]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","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 Tran. Comput.-Aided Des. Integr. Circuits 19(5), 501\u2013520 (2000)","journal-title":"IEEE Tran. Comput.-Aided Des. Integr. Circuits"},{"key":"7_CR2","unstructured":"Bengtsson, J.: Clocks, DBMs and states in timed systems. Ph.D. thesis, Department of Information Technology, Uppsala University (2002)"},{"key":"7_CR3","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. Theor. Comput. Sci. 474, 1\u201320 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR4","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. 2619, pp. 442\u2013457. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36577-X_33"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-07734-5_7","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"E Best","year":"2014","unstructured":"Best, E., Devillers, R.: Synthesis of persistent systems. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 111\u2013129. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07734-5_7"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.entcs.2009.05.037","volume":"239","author":"H Boucheneb","year":"2009","unstructured":"Boucheneb, H., Barkaoui, K.: Covering steps graphs of time Petri nets. Electron. Notes Theor. Comput. Sci. 239, 155\u2013165 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"7_CR7","first-page":"11:1","volume":"14","author":"H Boucheneb","year":"2015","unstructured":"Boucheneb, H., Barkaoui, K.: Stubborn sets for time Petri nets. ACM Trans. Embed. Comput. Syst. (TECS) 14(1), 11:1\u201311:25 (2015)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/s11241-017-9297-0","volume":"54","author":"H Boucheneb","year":"2018","unstructured":"Boucheneb, H., Barkaoui, K.: Delay-dependent partial order reduction technique for real time systems. Real-Time Syst. 54(2), 278\u2013306 (2018)","journal-title":"Real-Time Syst."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-10512-3_5","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"H Boucheneb","year":"2014","unstructured":"Boucheneb, H., Barkaoui, K., Weslati, K.: Delay-dependent partial order reduction technique for time Petri nets. In: Legay, A., Bozga, M. (eds.) FORMATS 2014. LNCS, vol. 8711, pp. 53\u201368. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10512-3_5"},{"issue":"6","key":"7_CR10","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. Log. Comput. 19(6), 1509\u20131540 (2009)","journal-title":"Log. Comput."},{"issue":"1\u20133","key":"7_CR11","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. Theor. Comput. Sci. TCS 353(1\u20133), 208\u2013227 (2006)","journal-title":"Theor. Comput. Sci. TCS"},{"key":"7_CR12","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. 7927, pp. 130\u2013149. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38697-8_8"},{"issue":"4","key":"7_CR13","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. Fundam. Inform. 88(4), 469\u2013495 (2008)","journal-title":"Fundam. Inform."},{"key":"7_CR14","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)","DOI":"10.1109\/PNPM.2001.953371"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-68746-7_7","volume-title":"Applications and Theory of Petri Nets","author":"E Best","year":"2008","unstructured":"Best, E., Darondeau, P.: Decomposition theorems for bounded persistent Petri nets. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 33\u201351. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68746-7_7"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR17","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. 8, pp. 113\u2013133 (1998)","DOI":"10.1016\/S1571-0661(05)80254-3"},{"issue":"1","key":"7_CR18","first-page":"2759","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. Theor. Comput. Sci. TCS 345(1), 2759 (2005)","journal-title":"Theor. Comput. Sci. TCS"},{"issue":"3","key":"7_CR19","first-page":"297","volume":"E99\u2013D","author":"T Yoneda","year":"1998","unstructured":"Yoneda, T., Ryuba, H.: CTL model checking of time Petri nets using geometric regions. EICE Trans. Inf. Syst. E99\u2013D(3), 297\u2013306 (1998)","journal-title":"EICE Trans. Inf. Syst."},{"issue":"2","key":"7_CR20","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. Form. Methods Syst. Des. 11(2), 187\u2013215 (1997)","journal-title":"Form. Methods Syst. Des."}],"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-030-00151-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T09:56:47Z","timestamp":1535191007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00151-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030001506","9783030001513"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00151-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}