{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:21Z","timestamp":1740099501663,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030296612"},{"type":"electronic","value":"9783030296629"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29662-9_12","type":"book-chapter","created":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:03:06Z","timestamp":1566241386000},"page":"199-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Distance Between Timed Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0255-0885","authenticated-orcid":false,"given":"Amnon","family":"Rosenmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"issue":"2","key":"12_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.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). \n                      https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"12_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R Alur","year":"1999","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. Theor. Comput. Sci. 211(1\u20132), 253\u2013273 (1999). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(97)00173-4","journal-title":"Theor. Comput. Sci."},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-31954-2_5","volume-title":"Hybrid Systems: Computation and Control","author":"R Alur","year":"2005","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 70\u201385. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/978-3-540-31954-2_5"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: a survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1\u201324. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-30080-9_1"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-02930-1_4","volume-title":"Automata, Languages and Programming","author":"C Baier","year":"2009","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When are timed automata determinizable? In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 43\u201354. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02930-1_4"},{"issue":"2\u20133","key":"12_CR6","doi-asserted-by":"publisher","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. 36(2\u20133), 145\u2013182 (1998). \n                      https:\/\/doi.org\/10.3233\/FI-1998-36233","journal-title":"Fundam. Inform."},{"issue":"2\u20133","key":"12_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2004.04.003","volume":"321","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable timed automata. Theor. Comput. Sci. 321(2\u20133), 291\u2013345 (2004). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2004.04.003","journal-title":"Theor. Comput. Sci."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2014.08.014","volume":"563","author":"P Bouyer","year":"2015","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robust reachability in timed automata and games: a game-based approach. Theor. Comput. Sci. 563, 43\u201374 (2015). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2014.08.014","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2011.08.002","volume":"413","author":"P Cern\u00fd","year":"2012","unstructured":"Cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Simulation distances. Theor. Comput. Sci. 413(1), 21\u201335 (2012). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2011.08.002","journal-title":"Theor. Comput. Sci."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BFb0014736","volume-title":"Hybrid and Real-Time Systems","author":"V Gupta","year":"1997","unstructured":"Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 331\u2013345. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/BFb0014736"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/3-540-55719-9_103","volume-title":"Automata, Languages and Programming","author":"TA Henzinger","year":"1992","unstructured":"Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 545\u2013558. Springer, Heidelberg (1992). \n                      https:\/\/doi.org\/10.1007\/3-540-55719-9_103"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s11241-017-9271-x","volume":"53","author":"F Lorber","year":"2017","unstructured":"Lorber, F., Rosenmann, A., Ni\u010dkovi\u0107, D., Aichernig, B.K.: Boundeddeterminization of timed automata with silent transitions. R. Time Syst. 53(3), 291\u2013326 (2017). \n                      https:\/\/doi.org\/10.1007\/s11241-017-9271-x","journal-title":"R. Time Syst."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-46002-0_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Ouaknine","year":"2002","unstructured":"Ouaknine, J.: Digitisation and full abstraction for dense-time model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 37\u201351. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-46002-0_4"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-04081-8_33","volume-title":"CONCUR 2009 - Concurrency Theory","author":"J Ouaknine","year":"2009","unstructured":"Ouaknine, J., Rabinovich, A., Worrell, J.: Time-bounded verification. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 496\u2013510. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04081-8_33"},{"doi-asserted-by":"publisher","unstructured":"Ouaknine, J., Worrell, J.: Revisiting digitization, robustness, and decidability for timed automata. In: Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), Ottawa, Canada, 22\u201325 June 2003, pp. 198\u2013207 (2003). \n                      https:\/\/doi.org\/10.1109\/LICS.2003.1210059","key":"12_CR15","DOI":"10.1109\/LICS.2003.1210059"},{"doi-asserted-by":"publisher","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: LICS, pp. 54\u201363 (2004). \n                      https:\/\/doi.org\/10.1109\/LICS.2004.1319600","key":"12_CR16","DOI":"10.1109\/LICS.2004.1319600"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-14162-1_3","volume-title":"Automata, Languages and Programming","author":"J Ouaknine","year":"2010","unstructured":"Ouaknine, J., Worrell, J.: Towards a theory of time-bounded verification. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 22\u201337. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14162-1_3"},{"unstructured":"Rosenmann, A.: The timestamp of timed automata. arXiv abs\/1412.5669v4 (2019). \n                      http:\/\/arxiv.org\/abs\/1412.5669","key":"12_CR18"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-85778-5_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"PV Suman","year":"2008","unstructured":"Suman, P.V., Pandya, P.K., Krishna, S.N., Manasa, L.: Timed automata with integer resets: language inclusion and expressiveness. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 78\u201392. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-85778-5_7"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29662-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:04:01Z","timestamp":1566241441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29662-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030296612","9783030296629"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29662-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lipn.univ-paris13.fr\/formats2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}