{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:40:38Z","timestamp":1740264038835,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540263012"},{"type":"electronic","value":"9783540315599"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494744_22","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T02:31:09Z","timestamp":1279074669000},"page":"385-402","source":"Crossref","is-referenced-by-count":17,"title":["Timed-Arc Petri Nets vs. Networks of Timed Automata"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","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":"22_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S1567-8326(02)00022-X","volume":"52-53","author":"L. Aceto","year":"2002","unstructured":"Aceto, L., Laroussinie, F.: Is your model checker on time? On the complexity of model checking for timed modal logics. Journal of Logic and Algebraic Programming\u00a052-53, 7\u201351 (2002)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"2","key":"22_CR3","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"},{"key":"22_CR4","volume-title":"Finite Transition Systems","author":"A. Arnold","year":"1994","unstructured":"Arnold, A.: Finite Transition Systems. Prentice-Hall, Englewood Cliffs (1994)"},{"issue":"2-3","key":"22_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B. Berard","year":"1998","unstructured":"Berard, B., Petit, A., Diekert, V., Gastin, P.: Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae\u00a036(2-3), 145\u2013182 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Berthomieu, B., Ribet, P.-O., Vernadat, F.: The tool tina - construction of abstract state spaces for petri nets and time petri nets. International Journal of Production Research (2004) (to appear)","DOI":"10.1080\/00207540412331312688"},{"key":"22_CR7","unstructured":"Bolognesi, T., Lucidi, F., Trigila, S.: From timed Petri nets to timed LOTOS. In: Proc. of the IFIP WG 6.1 Tenth International Symposium on Protocol Specification, Testing and Verification (Ottawa 1990), pp. 1\u201314 (1990)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-49213-5_5","volume-title":"Compositionality: The Significant Difference","author":"S. Bornot","year":"1998","unstructured":"Bornot, S., Sifakis, J., Tripakis, S.: Modeling urgency in timed systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol.\u00a01536, p. 103. Springer, Heidelberg (1998)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/3-540-36494-3_54","volume-title":"STACS 2003","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P.: Untameable timed automata! In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 620\u2013631. Springer, Heidelberg (2003)"},{"key":"22_CR10","unstructured":"Bowden, F.D.J.: Modelling time in Petri nets. In: Proc. of the Second Australia-Japan Workshop on Stochastic Models (1996), http:\/\/www.itr.unisa.edu.au\/~fbowden\/pprs\/stomod96\/"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/PNPM.1999.796566","volume-title":"Proc. of the 8th International Workshop on Petri Nets and Performance Models (PNPM 1999)","author":"M. Boyer","year":"1999","unstructured":"Boyer, M., Diaz, M.: Non equivalence between time Petri nets and time stream Petri nets. In: Proc. of the 8th International Workshop on Petri Nets and Performance Models (PNPM 1999), pp. 198\u2013207. IEEE Computer Society, Los Alamitos (1999)"},{"key":"22_CR12","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)"},{"issue":"2\u20133","key":"22_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3233\/FI-1999-402304","volume":"40","author":"N. Busi","year":"1999","unstructured":"Busi, N., Pinna, G.M.: Process semantics for place\/transition nets with inhibitor and read arcs. Fundamenta Informaticae\u00a040(2\u20133), 165\u2013197 (1999)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR14","series-title":"ENTCS","volume-title":"Workshop on Automated Verification of Critical Systems (AVoCS 2004)","author":"F. Cassez","year":"2004","unstructured":"Cassez, F., Roux, O.H.: Structural translation of time petri nets into timed automata. In: Workshop on Automated Verification of Critical Systems (AVoCS 2004). ENTCS. Elsevier, Amsterdam (2004)"},{"issue":"1-2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A. Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theoretical Computer Science\u00a0147(1-2), 117\u2013136 (1995)","journal-title":"Theoretical Computer Science"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Haar, S., Simonot-Lion, F., Kaiser, L., Toussaint, J.: Equivalence of timed state machines and safe time Petri nets. In: Proc. of the 6th International Workshop on Discrete Event Systems (WODES 2002), pp. 119\u2013126 (2002)","DOI":"10.1109\/WODES.2002.1167678"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"22_CR18","first-page":"254","volume-title":"Proc. of the 18th Annual Symposium on Foundations of Computer Science","author":"D. Kozen","year":"1977","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: Proc. of the 18th Annual Symposium on Foundations of Computer Science, pp. 254\u2013266. IEEE, Los Alamitos (1977)"},{"key":"22_CR19","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-0-387-35394-4_27","volume-title":"Proc. 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: Proc. 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, Dordrecht (1998)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-45931-6_19","volume-title":"Foundations of Software Science and Computation Structures","author":"F. Laroussinie","year":"2002","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: On model checking durational Kripke structures. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 264\u2013279. Springer, Heidelberg (2002)"},{"issue":"1\u20132","key":"22_CR21","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a Nutshell. International Journal on Software Tools for Technology Transfer\u00a01(1\u20132), 134\u2013152 (1997)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Lime, D., Roux, O.H.: State class timed automaton of a time Petri net. In: Proc. of the 10th International Workshop on Petri Net and Performance Models (PNPM 2003), pp. 124\u2013133 (2003)","DOI":"10.1109\/PNPM.2003.1231549"},{"key":"22_CR23","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":"22_CR24","unstructured":"Roux, O., Lime, D., Gardey, G.: software studio for time Petri net analysis, http:\/\/www.irccyn.ec-nantes.fr\/irccyn\/d\/en\/equipes\/TempsReel\/logs\/software-2-romeo"},{"key":"22_CR25","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. Valero Ruiz","year":"2000","unstructured":"Valero Ruiz, 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":"22_CR26","doi-asserted-by":"crossref","unstructured":"Valero Ruiz, V., Cuartero Gomez, F., de Frutos Escrig, D.: On non-decidability of reachability for timed-arc Petri nets. In: Proc. of the 8th International Workshop on Petri Net and Performance Models (PNPM 1999), pp. 188\u2013196 (1999)","DOI":"10.1109\/PNPM.1999.796565"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","first-page":"347","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)"},{"issue":"1","key":"22_CR28","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(01)00234-1","volume":"286","author":"W. Vogler","year":"2002","unstructured":"Vogler, W.: Partial order semantics and read arcs. Theoretical Computer Science\u00a0286(1), 33\u201363 (2002)","journal-title":"Theoretical Computer Science"},{"key":"22_CR29","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)"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494744_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:05:12Z","timestamp":1740261912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494744_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540263012","9783540315599"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11494744_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}