{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:32:23Z","timestamp":1762101143866,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_4","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T16:01:51Z","timestamp":1294156911000},"page":"46-72","source":"Crossref","is-referenced-by-count":24,"title":["Verification of Timed-Arc Petri Nets"],"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":"4_CR1","unstructured":"TAPAAL, http:\/\/www.tapaal.net"},{"key":"4_CR2","unstructured":"UPPAAL, http:\/\/www.uppaal.com"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Better is better than well: On efficient verification of infinite-state systems. In: Proceedings of 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 132\u2013140 (2000)","DOI":"10.1109\/LICS.2000.855762"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45740-2_5","volume-title":"Applications and Theory of Petri Nets 2001","author":"P.A. Abdulla","year":"2001","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Timed Petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.\u00a02075, pp. 53\u201370. Springer, Heidelberg (2001)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-30206-3_24","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Deneux, J., Mahata, P., Nyl\u00e9n, A.: Forward reachability analysis of timed Petri nets. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 343\u2013362. Springer, Heidelberg (2004)"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-3(1:1)2007","volume":"3","author":"P.A. Abdulla","year":"2007","unstructured":"Abdulla, P.A., Mahata, P., Mayr, R.: Dense-timed Petri nets: Checking zenoness, token liveness and boundedness. Logical Methods in Computer Science\u00a03(1), 1\u201361 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"1990","unstructured":"Alur, R., Dill, D.: Automata for modelling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 322\u2013335. Springer, Heidelberg (1990)"},{"issue":"2","key":"4_CR8","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\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/362946.362970","volume":"12","author":"K.A. Bartlett","year":"1969","unstructured":"Bartlett, K.A., Scantlebury, R.A., Wilkinson, P.T.: A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM\u00a012(5), 260\u2013261 (1969)","journal-title":"Communications of the ACM"},{"key":"4_CR10","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)"},{"issue":"3","key":"4_CR11","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":"14","key":"4_CR12","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1080\/00207540412331312688","volume":"42","author":"B. Berthomieu","year":"2004","unstructured":"Berthomieu, B., Ribet, P.-O., Vernadat, F.: The tool TINA \u2014 construction of abstract state spaces for Petri nets and time Petri nets. International Journal of Production Research\u00a042(14), 2741\u20132756 (2004)","journal-title":"International Journal of Production Research"},{"key":"4_CR13","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":"4_CR14","unstructured":"Bolognesi, T., Cremonese, P.: The weakness of some timed models for concurrent systems. Technical Report CNUCE C89-29, CNUCE\u2013C.N.R (1989)"},{"key":"4_CR15","first-page":"1","volume-title":"Proceedings of the IFIP WG 6.1 Tenth International Symposium on Protocol Specification, Testing and Verification (Ottawa 1990)","author":"T. Bolognesi","year":"1990","unstructured":"Bolognesi, T., Lucidi, F., Trigila, S.: From timed Petri nets to timed LOTOS. In: Proceedings of the IFIP WG 6.1 Tenth International Symposium on Protocol Specification, Testing and Verification (Ottawa 1990), pp. 1\u201314. North-Holland, Amsterdam (1990)"},{"issue":"6","key":"4_CR16","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":"4_CR17","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"},{"issue":"1","key":"4_CR18","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":"4_CR19","unstructured":"Bowden, F.D.J.: Modelling time in Petri nets. In: Proceedings of the Second Australia-Japan Workshop on Stochastic Models (1996)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1998","unstructured":"Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 546\u2013550. Springer, Heidelberg (1998)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-30080-9_8","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"M. Bozga","year":"2004","unstructured":"Bozga, M., Graf, S., Ober, I., Ober, I., Sifakis, J.: The IF toolset. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 237\u2013267. Springer, Heidelberg (2004)"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-642-10373-5_36","volume-title":"Formal Methods and Software Engineering","author":"J. Byg","year":"2009","unstructured":"Byg, J., J\u00f8rgensen, 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":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-04761-9_7","volume-title":"Automated Technology for Verification and Analysis","author":"J. Byg","year":"2009","unstructured":"Byg, J., J\u00f8rgensen, K.Y., Srba, J.: TAPAAL: Editor, simulator and verifier of timed-arc Petri nets. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 84\u201389. Springer, Heidelberg (2009)"},{"issue":"6","key":"4_CR24","first-page":"145","volume":"128","author":"F. Cassez","year":"2005","unstructured":"Cassez, F., Roux, O.H.: Structural translation from time Petri nets to timed automata. ENTCS\u00a0128(6), 145 (2005); Proc. of AVoCS 2004 (2004)","journal-title":"ENTCS"},{"issue":"6","key":"4_CR25","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"},{"issue":"1-2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"4_CR27","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":"4_CR28","unstructured":"Hack, M.: Petri Net Language. Technical Report MIT-LCS-TR-159, Massachusetts Institute of Technology, Cambridge, MA, USA (1976)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-56863-8_52","volume-title":"Application and Theory of Petri Nets 1993","author":"H.M. Hanisch","year":"1993","unstructured":"Hanisch, H.M.: Analysis of place\/transition nets with timed-arcs and its application to batch process control. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol.\u00a0691, pp. 282\u2013299. Springer, Heidelberg (1993)"},{"key":"4_CR30","unstructured":"Heitmann, F., Moldt, D., Mortensen, K.H., R\u00f6lke, H.: Petri nets tools database quick overview, http:\/\/www.informatik.uni-hamburg.de\/TGI\/PetriNets\/tools\/quick.html (accessed: 28.10.2010)"},{"key":"4_CR31","unstructured":"Jacobsen, L., Jacobsen, M., M\u00f8ller, M.H.: Undecidability of coverability and boundedness for timed-arc Petri nets with invariants. In: Proc. of MEMICS 2009. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2009) ISBN 978-3-939897-15-6"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Jacobsen, L., Jacobsen, M., M\u00f8ller, M.H.: Modelling and verification of timed-arc Petri nets. Master\u2019s thesis, Department of Computer Science, Aalborg University, Denmark (2010a), http:\/\/tapaal.net","DOI":"10.1007\/978-3-642-18381-2_4"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-15784-4_6","volume-title":"Computer Performance Engineering","author":"L. Jacobsen","year":"2010","unstructured":"Jacobsen, L., Jacobsen, M., M\u00f8ller, M.H., Srba, J.: A framework for relating timed transition systems and preserving TCTL model checking. In: Aldini, A., Bernardo, M., Bononi, L., Cortellessa, V. (eds.) EPEW 2010. LNCS, vol.\u00a06342, pp. 83\u201398. Springer, Heidelberg (2010)"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Jacobsen, L., Jacobsen, M., M\u00f8ller, 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. (2010c)","DOI":"10.1007\/978-3-642-15784-4_6"},{"issue":"1-4","key":"4_CR35","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"},{"issue":"1","key":"4_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Transactions on Computer Systems"},{"key":"4_CR37","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-0-387-35394-4_27","volume-title":"Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)","author":"F. Laroussinie","year":"1998","unstructured":"Laroussinie, F., Larsen, K.G.: CMC: A tool for compositional model-checking of real-time systems. In: Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII), pp. 439\u2013456. Kluwer, B.V (1998)"},{"key":"4_CR38","first-page":"238","volume-title":"Proceedings of the 13th Ann. ACM Symposium on Theory of Computing","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem (preliminary version). In: Proceedings of the 13th Ann. ACM Symposium on Theory of Computing, pp. 238\u2013246. ACM, New York (1981)"},{"key":"4_CR39","unstructured":"Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD thesis, University of California, Irvine, CA, USA (1974)"},{"issue":"9","key":"4_CR40","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TCOM.1976.1093424","volume":"24","author":"P.M. Merlin","year":"1976","unstructured":"Merlin, P.M., Faber, D.J.: Recoverability of communication protocols: Implications of a theoretical study. IEEE Transactions on Communications\u00a024(9), 1036\u20131043 (1976)","journal-title":"IEEE Transactions on Communications"},{"key":"4_CR41","volume-title":"Computation: Finite and Infinite Machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"4_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45294-X_24","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"M. Nielsen","year":"2001","unstructured":"Nielsen, M., Sassone, V., Srba, J.: Properties of distributed timed-arc Petri nets. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 280\u2013291. Springer, Heidelberg (2001)"},{"key":"4_CR43","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/MULMM.2004.1264966","volume-title":"Proceedings of the 10th International Multimedia Modelling Conference (MMM 2004)","author":"F.L. Pelayo","year":"2004","unstructured":"Pelayo, F.L., Cuartero, F., Valero, V., Macia, H., Pelayo, M.L.: Applying timed-arc Petri nets to improve the performance of the MPEG-2 encoding algorithm. In: Proceedings of the 10th International Multimedia Modelling Conference (MMM 2004), pp. 49\u201356. IEEE Computer Society, Los Alamitos (2004)"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Pelayo, F.L., Cuartero, F., Valero, V., Pelayo, M.L., Merayo, M.G.: How does the memory work? by timed-arc Petri nets. In: Proceedings of the 4th IEEE International Conference on Cognitive Informatics (ICCI 2005), pp. 128\u2013135 (2005)","DOI":"10.1109\/COGINF.2005.1532624"},{"key":"4_CR45","doi-asserted-by":"publisher","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. Springer, Heidelberg (2006)"},{"key":"4_CR46","unstructured":"Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Darmstadt (1962)"},{"key":"4_CR47","unstructured":"Ramchandani, C.: Performance Evaluation of Asynchronous Concurrent Systems by Timed Petri Nets. PhD thesis, Massachusetts Institute of Technology, Cambridge (1973)"},{"key":"4_CR48","unstructured":"Ruiz, V.V., Cuartero Gomez, F., de Frutos Escrig, D.: On non-decidability of reachability for timed-arc Petri nets. In: Proceedings of the 8th International Workshop on Petri Net and Performance Models (PNPM 1999), pp. 188\u2013196 (1999)"},{"key":"4_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-44988-4_12","volume-title":"Application and Theory of Petri Nets 2000","author":"V.V. Ruiz","year":"2000","unstructured":"Ruiz, V.V., de Frutos Escrig, D., Marroquin Alonso, O.: Decidability of properties of timed-arc petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 187\u2013206. Springer, Heidelberg (2000)"},{"key":"4_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/3-540-48068-4_24","volume-title":"Application and Theory of Petri Nets 2002","author":"V.V. Ruiz","year":"2002","unstructured":"Ruiz, V.V., Pardo, J.J., Cuartero, F.: Translating TPAL specifications into timed-arc Petri nets. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol.\u00a02360, pp. 414\u2013433. Springer, Heidelberg (2002)"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"Ruiz, V.V., Pelayo, F.L., Cuartero, F., Cazorla, D.: Specification and analysis of the MPEG-2 video encoder with timed-arc Petri nets. Electronic Notes Theoretial Computer Science\u00a066(2) (2002)","DOI":"10.1016\/S1571-0661(04)80407-9"},{"key":"4_CR52","first-page":"75","volume-title":"Proceedings of the Third International Symposium IFIP W.G. 7.3., Measuring, Modelling and Evaluating Computer Systems (Bonn-Bad Godesberg)","author":"J. Sifakis","year":"1977","unstructured":"Sifakis, J.: Use of Petri nets for performance evaluation. In: Proceedings of the Third International Symposium IFIP W.G. 7.3., Measuring, Modelling and Evaluating Computer Systems (Bonn-Bad Godesberg), pp. 75\u201393. Elsevier Science Publishers, Amsterdam (1977)"},{"key":"4_CR53","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":"4_CR54","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":"4_CR55","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)"},{"key":"4_CR56","volume-title":"Timed Petri Nets, Theory and Application","author":"J. Wang","year":"1998","unstructured":"Wang, J.: Timed Petri Nets, Theory and Application. Kluwer Academic Publishers, Dordrecht (1998) ISBN ISBN 0-7923-8270-6"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T11:24:01Z","timestamp":1740828241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}