{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:48:06Z","timestamp":1762458486586},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540346999"},{"type":"electronic","value":"9783540347002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11767589_8","type":"book-chapter","created":{"date-parts":[[2006,6,20]],"date-time":"2006-06-20T14:38:34Z","timestamp":1150814314000},"page":"125-145","source":"Crossref","is-referenced-by-count":18,"title":["Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Chatain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Jard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"8_CR1","first-page":"2601","volume":"E86-D","author":"T. Kitai","year":"2001","unstructured":"Kitai, T., Oguro, Y., Yoneda, T., Mercer, E., Myers, C.: Partial order reduction for timed circuit verification based on a level oriented model. IEICE Trans.\u00a0E86-D(12), 2601\u20132611 (2001)","journal-title":"IEICE Trans."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45740-2_19","volume-title":"Applications and Theory of Petri Nets 2001","author":"W. Penczek","year":"2001","unstructured":"Penczek, W., P\u00f3lrola, A.: Abstractions and partial order reductions for checking branching properties of time Petri nets. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.\u00a02075, pp. 323\u2013342. Springer, Heidelberg (2001)"},{"key":"#cr-split#-8_CR3.1","doi-asserted-by":"crossref","unstructured":"Chatain, T., Jard, C.: Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.??3829, pp. 196???210. Springer, Heidelberg (2005);","DOI":"10.1007\/11603009_16"},{"key":"#cr-split#-8_CR3.2","unstructured":"Extended version available in INRIA Research Report RR-5706"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-63139-9_34","volume-title":"Application and Theory of Petri Nets 1997","author":"T. Aura","year":"1997","unstructured":"Aura, T., Lilius, J.: Time processes for time Petri nets. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.\u00a01248, pp. 136\u2013155. Springer, Heidelberg (1997)"},{"key":"8_CR5","series-title":"ENTCS","volume-title":"MFCS Workshop on Concurrency 1998","author":"J. Lilius","year":"1999","unstructured":"Lilius, J.: Efficient state space search for time Petri nets. In: MFCS Workshop on Concurrency 1998. ENTCS, vol.\u00a018. Elsevier, Amsterdam (1999)"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"K.L. McMillan","year":"1995","unstructured":"McMillan, K.L.: A technique of state space search based on unfolding. Formal Methods in System Design\u00a06(1), 45\u201365 (1995)","journal-title":"Formal Methods in System Design"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"20","author":"J. Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Formal Methods in System Design\u00a020(3), 285\u2013310 (2002)","journal-title":"Formal Methods in System Design"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-48320-9_16","volume-title":"CONCUR\u201999. Concurrency Theory","author":"B. Bieber","year":"1999","unstructured":"Bieber, B., Fleischhack, H.: Model checking of time Petri nets based on partial order semantics. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 210\u2013225. Springer, Heidelberg (1999)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-48068-4_11","volume-title":"Application and Theory of Petri Nets 2002","author":"H. Fleischhack","year":"2002","unstructured":"Fleischhack, H., Stehno, C.: Computing a finite prefix of a time Petri net. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol.\u00a02360, pp. 163\u2013181. Springer, Heidelberg (2002)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/32.75415","volume":"17","author":"B. Berthomieu","year":"1991","unstructured":"Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. Software Eng.\u00a017(3), 259\u2013273 (1991)","journal-title":"IEEE Trans. Software Eng."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/240518.240530","volume-title":"DAC","author":"A.L. Semenov","year":"1996","unstructured":"Semenov, A.L., Yakovlev, A.: Verification of asynchronous circuits using time Petri net unfolding. In: DAC, pp. 59\u201362. ACM Press, New York (1996)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Merlin, P., Farber, D.: Recoverability of communication protocols \u2013 implications of a theorical study. IEEE Transactions on Communications\u00a024 (1976)","DOI":"10.1109\/TCOM.1976.1093424"},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching processes of Petri nets. Acta Inf.\u00a028(6), 575\u2013591 (1991)","journal-title":"Acta Inf."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-30232-2_21","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"T. Chatain","year":"2004","unstructured":"Chatain, T., Jard, C.: Symbolic diagnosis of partially observable concurrent systems. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol.\u00a03235, pp. 326\u2013342. Springer, Heidelberg (2004)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BFb0046840","volume-title":"Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I","author":"E. Best","year":"1987","unstructured":"Best, E.: Structure theory of Petri nets: the free choice hiatus. In: Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I, London, UK, pp. 168\u2013205. Springer, Heidelberg (1987)"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3060","volume":"171","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures, and processes. Inf. Comput.\u00a0171(1), 1\u201349 (2001)","journal-title":"Inf. Comput."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BFb0055644","volume-title":"CONCUR \u201998 Concurrency Theory","author":"W. Vogler","year":"1998","unstructured":"Vogler, W., Semenov, A.L., Yakovlev, A.: Unfolding and finite prefix for nets with read arcs. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 501\u2013516. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Petri Nets and Other Models of Concurrency - ICATPN 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11767589_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:31Z","timestamp":1619507491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11767589_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540346999","9783540347002"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11767589_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}