{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:23:55Z","timestamp":1725891835094},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540472377"},{"type":"electronic","value":"9783540472384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11901914_24","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T05:21:43Z","timestamp":1160457703000},"page":"307-321","source":"Crossref","is-referenced-by-count":12,"title":["Symbolic Unfoldings for Networks of Timed Automata"],"prefix":"10.1007","author":[{"given":"Franck","family":"Cassez","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Chatain","sequence":"additional","affiliation":[]},{"given":"Claude","family":"Jard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science (TCS)\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 147\u2013161. Springer, Heidelberg (2001)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11603009_17","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"B. B\u00e9rard","year":"2005","unstructured":"B\u00e9rard, B., Cassez, F., Haddad, S., Roux, O.H., Lime, D.: Comparison of the Expressiveness of Timed Automata and Time Petri Nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"issue":"3","key":"24_CR5","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."},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods in System Design\u00a024(3), 281\u2013320 (2004)","journal-title":"Formal Methods in System Design"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Cassez, F., Chatain, T., Jard, C.: Symbolic Unfoldings for Networks of Timed Automata. Technical Report RI-2006-4, IRCCyN\/CNRS, Nantes (May 2006)","DOI":"10.1007\/11901914_24"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Cassez, F., Roux, O.H.: Structural translation from time petri nets to timed automata. Journal of Systems and Software (forthcoming, 2006)","DOI":"10.1016\/j.jss.2005.12.021"},{"key":"24_CR9","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)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-48320-9_2","volume-title":"CONCUR\u201999. Concurrency Theory","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., R\u00f6mer, S.: An unfolding algorithm for synchronous products of transition systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 2\u201320. Springer, Heidelberg (1999)"},{"issue":"3","key":"24_CR11","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":"24_CR12","doi-asserted-by":"crossref","unstructured":"Fleischhack, H., Stehno, C.: Computing a finite prefix of a time Petri net. ICATPN, 163\u2013181 (2002)","DOI":"10.1007\/3-540-48068-4_11"},{"key":"24_CR13","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. Bengtsson","year":"1998","unstructured":"Bengtsson, J., 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":"24_CR14","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/REAL.1997.641265","volume-title":"Proc. 18th IEEE Real-Time Systems Symposium (RTSS 1997)","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: Efficient verification of real-time systems: Compact data structure and state-space reduction. In: Proc. 18th IEEE Real-Time Systems Symposium (RTSS 1997), pp. 14\u201324. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-24730-2_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Lugiez","year":"2004","unstructured":"Lugiez, D., Niebert, P., Zennou, S.: A partial order semantics approach to the clock explosion problem of timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 296\u2013311. Springer, Heidelberg (2004)"},{"issue":"1","key":"24_CR16","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"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Merlin, P.M., Farber, D.J.: Recoverability of communication protocols \u2013 implications of a theorical study. IEEE Transactions on Communications 24 (1976)","DOI":"10.1109\/TCOM.1976.1093424"},{"key":"24_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)"},{"issue":"243","key":"24_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S0304-3975(99)00114-0","volume":"1\u20132","author":"T. Aura","year":"2000","unstructured":"Aura, T., Lilius, J.: A causal semantics for time petri nets. Theoretical Computer Science\u00a01\u20132(243), 409\u2013447 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"11","key":"24_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1008682131325","volume":"2","author":"T. Yoneda","year":"1997","unstructured":"Yoneda, T., Schlingloff, B.-H.: Efficient verification of parallel real-time systems. Formal Methods in System Design\u00a02(11), 187\u2013215 (1997)","journal-title":"Formal Methods in System Design"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483, pp. 491\u2013515. Springer, Heidelberg (1991)"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BFb0028762","volume-title":"Computer Aided Verification","author":"W. Belluomini","year":"1998","unstructured":"Belluomini, W., Myers, C.J.: Verification of timed systems using posets. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 403\u2013415. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11901914_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:56:13Z","timestamp":1605642973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11901914_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472377","9783540472384"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11901914_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}