{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T22:50:35Z","timestamp":1767999035866,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642222559","type":"print"},{"value":"9783642222566","type":"electronic"}],"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-22256-6_23","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:37:04Z","timestamp":1311010624000},"page":"250-263","source":"Crossref","is-referenced-by-count":5,"title":["Distributed Event Clock Automata"],"prefix":"10.1007","author":[{"given":"James","family":"Ortiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Yves","family":"Schobbens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-85361-9_10","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S. Akshay","year":"2008","unstructured":"Akshay, S., Bollig, B., Gastin, P., Mukund, M., Narayan Kumar, K.: Distributed timed automata with independently evolving clocks. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 82\u201397. Springer, Heidelberg (2008)"},{"issue":"2","key":"23_CR2","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.L.: A theory of timed automata. Theor. Comput. Sci.\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. ACM\u00a043(1), 116\u2013146 (1996)","journal-title":"ACM"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58179-0_39","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1994","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: A determinizable class of timed automata. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 1\u201313. Springer, Heidelberg (1994)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BFb0031988","volume-title":"Real-Time: Theory in Practice","author":"R. Alur","year":"1992","unstructured":"Alur, R., Henzinger, T.A.: Logics and models of real time: A survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol.\u00a0600, pp. 74\u2013106. Springer, Heidelberg (1992)"},{"key":"23_CR6","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.E. Bengtsson","year":"1998","unstructured":"Bengtsson, J.E., 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)"},{"issue":"2-3","key":"23_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B. B\u00e9rard","year":"1998","unstructured":"B\u00e9rard, B., Petit, A., Diekert, V., Gastin, P.: Characterization of the expressive power of silent transitions in timed automata. Fundam. Inform.\u00a036(2-3), 145\u2013182 (1998)","journal-title":"Fundam. Inform."},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-30206-3_10","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"M. Wulf De","year":"2004","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robustness and implementability of timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 118\u2013133. Springer, Heidelberg (2004)"},{"key":"23_CR9","first-page":"131","volume-title":"Essays in honor of Gheorghe P\u0103un","author":"C. Dima","year":"2003","unstructured":"Dima, C.: Distributed real-time automata. In: Martin-Vide, C., Mitrana, V. (eds.) Essays in honor of Gheorghe P\u0103un, pp. 131\u2013140. Taylor & Francis, Abington (2003)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-75292-9_13","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2007","author":"C. Dima","year":"2007","unstructured":"Dima, C., Lanotte, R.: Distributed time-asynchronous automata. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol.\u00a04711, pp. 185\u2013200. Springer, Heidelberg (2007)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-04368-0_12","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"L. Doyen","year":"2009","unstructured":"Doyen, L., Geeraerts, G., Raskin, J.-F., Reichert, J.: Realizability of real-time logics. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol.\u00a05813, pp. 133\u2013148. Springer, Heidelberg (2009)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 580\u2013591. Springer, Heidelberg (1998)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/11821069_43","volume-title":"Mathematical Foundations of Computer Science 2006","author":"Y. Hirshfeld","year":"2006","unstructured":"Hirshfeld, Y., Rabinovich, A.: An expressive temporal logic for real time. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 492\u2013504. Springer, Heidelberg (2006)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Krishnan, P.: Distributed timed automata. Electr. Notes Theor. Comput. Sci.\u00a028 (1999)","DOI":"10.1016\/S1571-0661(05)80627-9"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-15297-9_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J. Jerson Ortiz","year":"2010","unstructured":"Jerson Ortiz, J., Legay, A., Schobbens, P.-Y.: Memory event clocks. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol.\u00a06246, pp. 198\u2013212. Springer, Heidelberg (2010)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Ortiz, J., Legay, A., Schobbens, P.-Y.: Distributed event clock automata. Tech. rep., FUNDP University, Belgium (2011), http:\/\/www.info.fundp.ac.be\/~jor\/DecaReport","DOI":"10.1007\/978-3-642-22256-6_23"},{"key":"23_CR17","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, pp. 255\u2013264. IEEE Computer Society, Washington, DC, USA (2006), http:\/\/portal.acm.org\/citation.cfm?id=1157735.1158062"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0055349","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"A. Puri","year":"1998","unstructured":"Puri, A.: Dynamical properties of timed automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol.\u00a01486, pp. 210\u2013227. Springer, Heidelberg (1998)"},{"key":"23_CR19","unstructured":"Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real Time. PhD thesis, FUNDP University, Belgium (1999), http:\/\/www.ulb.ac.be\/di\/ssd\/jfr\/"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BFb0014711","volume-title":"Hybrid and Real-Time Systems","author":"J.-F. Raskin","year":"1997","unstructured":"Raskin, J.-F., Schobbens, P.-Y.: State clock logic: A decidable real-time logic. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 33\u201347. Springer, Heidelberg (1997)"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(00)00308-X","volume":"274","author":"P.-Y. Schobbens","year":"2002","unstructured":"Schobbens, P.-Y., Raskin, J.-F., Henzinger, T.A.: Axioms for real-time logics. Theoretical Computer Science\u00a0274, 151\u2013182 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"Wolper, P.: Temporal logic can be more expressive. Information and Control\u00a056(1-2), 72\u201399 (1983)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22256-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T11:02:29Z","timestamp":1592737349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}