{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:02Z","timestamp":1740099482301,"version":"3.37.3"},"publisher-location":"Cham","reference-count":28,"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_11","type":"book-chapter","created":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:03:06Z","timestamp":1566241386000},"page":"181-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Timestamp of 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":"11_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":"11_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":"11_CR3","doi-asserted-by":"publisher","unstructured":"Alur, R., Kurshan, R.P., Viswanathan, M.: Membership questions for timed and hybrid automata. In: Real-Time Systems Symposium, pp. 254\u2013263 (1998). \n                      https:\/\/doi.org\/10.1109\/REAL.1998.739751","DOI":"10.1109\/REAL.1998.739751"},{"key":"11_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":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48983-5_6","volume-title":"Hybrid Systems: Computation and Control","author":"E Asarin","year":"1999","unstructured":"Asarin, E., Maler, O.: As soon as possible: time optimal control for timed automata. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol. 1569, pp. 19\u201330. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48983-5_6"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-02930-1_4","volume-title":"Automata, Languages and Programming","author":"Christel Baier","year":"2009","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When are timed automata determinizable? In: ICALP (2), pp. 43\u201354 (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02930-1_4"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0053543","volume-title":"Foundations of Software Science and Computation Structures","author":"D Beauquier","year":"1998","unstructured":"Beauquier, D.: Pumping lemmas for timed automata. In: Nivat, M. (ed.) FoSSaCS 1998. LNCS, vol. 1378, pp. 81\u201394. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0053543"},{"issue":"2\u20133","key":"11_CR8","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":"11_CR9","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":"11_CR10","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: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 546\u2013550. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0028779"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Chen, T., Han, T., Katoen, J., Mereacre, A.: Reachability probabilities in Markovian timed automata. In: CDC-ECC, pp. 7075\u20137080 (2011). \n                      https:\/\/doi.org\/10.1109\/CDC.2011.6160992","DOI":"10.1109\/CDC.2011.6160992"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.25596\/jalc-2000-371","volume":"5","author":"C Choffrut","year":"2000","unstructured":"Choffrut, C., Goldwurm, M.: Timed automata with periodic clock constraints. J. Autom. Lang. Comb. 5(4), 371\u2013403 (2000). \n                      https:\/\/doi.org\/10.25596\/jalc-2000-371","journal-title":"J. Autom. Lang. Comb."},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-48320-9_18","volume-title":"CONCUR 1999 Concurrency Theory","author":"H Comon","year":"1999","unstructured":"Comon, H., Jurski, Y.: Timed automata and the theory of real numbers. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 242\u2013257. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48320-9_18"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF00709157","volume":"1","author":"C Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. Form. Methods Syst. Des. 1(4), 385\u2013415 (1992). \n                      https:\/\/doi.org\/10.1007\/BF00709157","journal-title":"Form. Methods Syst. Des."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 313\u2013329. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0054180"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/11867340_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"O Finkel","year":"2006","unstructured":"Finkel, O.: Undecidable problems about timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 187\u2013199. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11867340_14"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-33512-9_6","volume-title":"Reachability Problems","author":"C Haase","year":"2012","unstructured":"Haase, C., Ouaknine, J., Worrell, J.: On the relationship between reachability problems in timed and counter automata. In: Finkel, A., Leroux, J., Potapov, I. (eds.) RP 2012. LNCS, vol. 7550, pp. 54\u201365. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33512-9_6"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11867340_1","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"TA Henzinger","year":"2006","unstructured":"Henzinger, T.A., Prabhu, V.S.: Timed alternating-time temporal logic. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 1\u201317. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11867340_1"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"issue":"1\u20132","key":"11_CR20","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"KG Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. STTT 1(1\u20132), 134\u2013152 (1997). \n                      https:\/\/doi.org\/10.1007\/s100090050010","journal-title":"Uppaal in a nutshell. STTT"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"291326","DOI":"10.1007\/s11241-017-9271-x","volume":"53","author":"F Lorber","year":"2017","unstructured":"Lorber, F., Rosenmann, A., Nickovic, D., Aichernig, B.K.: Bounded determinization of timed automata with silent transitions. Real Time Syst. 53(3), 291326 (2017). \n                      https:\/\/doi.org\/10.1007\/s11241-017-9271-x","journal-title":"Real Time Syst."},{"key":"11_CR22","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"},{"key":"11_CR23","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","DOI":"10.1109\/LICS.2004.1319600"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-14162-1_3","volume-title":"Automata, Languages and Programming","author":"Jo\u00ebl Ouaknine","year":"2010","unstructured":"Ouaknine, J., Worrell, J.: Towards a theory of time-bounded verification. In: ICALP (2), pp. 22\u201337 (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14162-1_3"},{"key":"11_CR25","unstructured":"Rosenmann, A.: The timestamp of timed automata. arXiv abs\/1412.5669v4 (2019). \n                      http:\/\/arxiv.org\/abs\/1412.5669"},{"issue":"1","key":"11_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1008734703554","volume":"18","author":"S Tripakis","year":"2001","unstructured":"Tripakis, S., Yovine, S.: Analysis of timed systems using time-abstracting bisimulations. Form. Methods Syst. Des. 18(1), 25\u201368 (2001). \n                      https:\/\/doi.org\/10.1023\/A:1008734703554","journal-title":"Form. Methods Syst. Des."},{"issue":"1","key":"11_CR27","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10009-003-0135-4","volume":"6","author":"F Wang","year":"2004","unstructured":"Wang, F.: Efficient verification of timed automata with BDD-like data structures. STTT 6(1), 77\u201397 (2004). \n                      https:\/\/doi.org\/10.1007\/s10009-003-0135-4","journal-title":"STTT"},{"issue":"2","key":"11_CR28","first-page":"223","volume":"55","author":"B Wozna","year":"2003","unstructured":"Wozna, B., Zbrzezny, A., Penczek, W.: Checking reachability properties for timed automata via SAT. Fundam. Inform. 55(2), 223\u2013241 (2003)","journal-title":"Fundam. Inform."}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:04:11Z","timestamp":1566241451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29662-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030296612","9783030296629"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29662-9_11","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)"}}]}}