{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T09:25:02Z","timestamp":1750843502530,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157837"},{"type":"electronic","value":"9783642157844"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15784-4_6","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T12:39:38Z","timestamp":1284986378000},"page":"83-98","source":"Crossref","is-referenced-by-count":5,"title":["A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking"],"prefix":"10.1007","author":[{"given":"Lasse","family":"Jacobsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten","family":"Jacobsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael H.","family":"M\u00f8ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Archer, M., HongPing, L., Lynch, N., Mitra, S., Umeno, S.: Specifying and proving properties of timed I\/O automata in the TIOA toolkit. In: Proc. of MEMOCODE 2006, pp. 129\u2013138 (2006)","DOI":"10.1109\/MEMCOD.2006.1695916"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G. Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 200\u2013236. Springer, Heidelberg (2004)"},{"key":"6_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., Lime, D., Roux, O.H.: 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)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/11867340_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"B. Berthomieu","year":"2006","unstructured":"Berthomieu, B., Peres, F., Vernadat, F.: Bridging the gap between timed automata and bounded time Petri nets. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol.\u00a04202, pp. 82\u201397. Springer, Heidelberg (2006)"},{"key":"6_CR6","unstructured":"Bolognesi, T., Lucidi, F., Trigila, S.: From timed Petri nets to timed LOTOS. In: Proc. of PSTV 1990, pp. 395\u2013408 (1990)"},{"issue":"6","key":"6_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. Journal of Logic and Computation\u00a019(6), 1509\u20131540 (2009)","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ic.2007.10.004","volume":"206","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Haddad, S., Reynier, P.A.: Timed Petri nets and timed automata: On the discriminating power of Zeno sequences. Information and Computation\u00a0206(1), 73\u2013107 (2008)","journal-title":"Information and Computation"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1007\/978-3-642-10373-5_36","volume-title":"ICFEM 2009","author":"J. Byg","year":"2009","unstructured":"Byg, J., Joergensen, K.Y., Srba, J.: An efficient translation of timed-arc Petri nets to networks of timed automata. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol.\u00a05885, pp. 698\u2013716. Springer, Heidelberg (2009)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Cassez, F., Roux, O.H.: Structural translation from time Petri nets to timed automata. ENTCS\u00a0128(6), 145\u2013160 (2005); Proc. of AVoCS 2004","DOI":"10.1016\/j.entcs.2005.04.009"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1109\/TSE.2008.52","volume":"34","author":"J.S. Dong","year":"2008","unstructured":"Dong, J.S., Hao, P., Qin, S., Sun, J., Yi, W.: Timed Automata Patterns. IEEE Transactions on Software Engingeering\u00a034(6), 844\u2013859 (2008)","journal-title":"IEEE Transactions on Software Engingeering"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/11513988_41","volume-title":"Computer Aided Verification","author":"G. Gardey","year":"2005","unstructured":"Gardey, G., Lime, D., Magnin, M., Roux, O.H.: Romeo: A tool for analyzing time Petri nets. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 418\u2013423. Springer, Heidelberg (2005)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Jacobsen, L., Jacobsen, M., M\u00f6ller, M.H., Srba, J.: A framework for relating timed transition systems and preserving TCTL model checking. Technical Report FIMU-RS-2010-09, Faculty of Informatics, Masaryk Univ. (2010)","DOI":"10.1007\/978-3-642-15784-4_6"},{"issue":"1-4","key":"6_CR14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.3233\/FUN-2008-851-417","volume":"85","author":"A. Janowska","year":"2008","unstructured":"Janowska, A., Janowski, P., Wr\u00f3blewski, D.: Translation of Intermediate Language to Timed Automata with Discrete Data. Fundamenta Informaticae\u00a085(1-4), 235\u2013248 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR15","unstructured":"Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Irvine (1974)"},{"key":"6_CR16","series-title":"SCI","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-32870-4","volume-title":"Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach","author":"W. Penczek","year":"2006","unstructured":"Penczek, W., P\u00f3lrola, A.: Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. SCI, vol.\u00a020. Springer, Heidelberg (2006)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-60922-9_29","volume-title":"STACS 96","author":"J. Sifakis","year":"1996","unstructured":"Sifakis, J., Yovine, S.: Compositional specification of timed systems. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 347\u2013359. Springer, Heidelberg (1996)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/11494744_22","volume-title":"Applications and Theory of Petri Nets 2005","author":"J. Srba","year":"2005","unstructured":"Srba, J.: Timed-arc Petri nets vs. networks of timed automata. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 385\u2013402. Springer, Heidelberg (2005)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-85778-5_3","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J. Srba","year":"2008","unstructured":"Srba, J.: Comparing the expressiveness of timed automata and timed extensions of Petri nets. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 15\u201332. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Computer Performance Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15784-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:02:18Z","timestamp":1740524538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15784-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157837","9783642157844"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15784-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}