{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:57:50Z","timestamp":1742943470900,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819975839"},{"type":"electronic","value":"9789819975846"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-7584-6_6","type":"book-chapter","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:05:39Z","timestamp":1699488339000},"page":"83-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Extrapolation in\u00a0Extended Timed Automata"],"prefix":"10.1007","author":[{"given":"Nicolaj \u00d8.","family":"Jensen","sequence":"first","affiliation":[]},{"given":"Peter G.","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Arcile, J., Andr\u00e9, \u00c9.: Zone extrapolations in parametric timed automata. In: Deshmukh, J.V., Havelund, K., Perez, I. (eds.) NASA Formal Methods. NFM 2022. LNCS, vol. 13260, pp. 451\u2013469. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06773-0_24","DOI":"10.1007\/978-3-031-06773-0_24"},{"key":"6_CR2","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-36577-X_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Behrmann","year":"2003","unstructured":"Behrmann, G., Bouyer, P., Fleury, E., Larsen, K.G.: Static guard analysis in timed automata verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 254\u2013270. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_18"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e1nek, R.: Lower and upper bounds in zone based abstractions of timed automata. In: Jensen, K., Podelski, A. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 312\u2013326. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/s10009-005-0190-0","DOI":"10.1007\/s10009-005-0190-0"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87\u2013124. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_3"},{"key":"6_CR6","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. 2607, pp. 620\u2013631. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_54"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods Syst. Des. 24, 281\u2013320 (2004). https:\/\/doi.org\/10.1023\/B:FORM.0000026093.21513.31","journal-title":"Formal Methods Syst. Des."},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Gastin, P., Herbreteau, F., Sankur, O., Srivathsan, B.: Zone-based verification of timed automata: extrapolations, simulations and what next?. In: Bogomolov, S., Parker, D. (eds.) Formal Modeling and Analysis of Timed Systems. FORMATS 2022. LNCS, vol. 13465, pp. 16\u201342 (2022). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-15839-1_2","DOI":"10.1007\/978-3-031-15839-1_2"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R., et al.: Handbook of model checking, vol. 10. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8","DOI":"10.1007\/978-3-319-10575-8"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"David, A., et al.: Uppaal 4.0. In: Third International Conference on the Quantitative Evaluation of SysTems (QEST) 2006, pp. 125\u2013126. IEEE Computer Society Press, United States (2006). https:\/\/doi.org\/10.1109\/QEST.2006.59","DOI":"10.1109\/QEST.2006.59"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems. pp. 197\u2013212. Springer, Berlin (1990). https:\/\/doi.org\/10.1007\/3-540-52148-8_17","DOI":"10.1007\/3-540-52148-8_17"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Gastin, P., Mukherjee, S., Srivathsan, B.: Fast algorithms for handling diagonal constraints in timed automata. In: Dillig, I., Tasiran, S. (eds.) Computer Aided Verification. pp. 41\u201359. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_3","DOI":"10.1007\/978-3-030-25540-4_3"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. Inf. Comput. 251, 67\u201390 (2016). https:\/\/doi.org\/10.1016\/j.ic.2016.07.004","DOI":"10.1016\/j.ic.2016.07.004"},{"key":"6_CR14","first-page":"181","volume":"72","author":"A Janowska","year":"2006","unstructured":"Janowska, A., Janowski, P.: Slicing of timed automata with discrete data. Fundam. Informaticae 72, 181\u2013195 (2006)","journal-title":"Fundam. Informaticae"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Liu, Y., Sun, J., Dong, J.S.: Developing model checkers using PAT. In: Bouajjani, A., Chin, W.N. (eds.) Automated Technology for Verification and Analysis, pp. 371\u2013377. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-15643-4_30","DOI":"10.1007\/978-3-642-15643-4_30"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Lund, S., van Diepen, J., Larsen, K.G., Mu\u00f1iz, M., J\u00f8rgensen, T.R., Andersen, T.S.D.: An integer static analysis for better extrapolation in Uppaal. In: Dima, C., Shirmohammadi, M. (eds.) Formal Modeling and Analysis of Timed Systems. pp. 84\u201399. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85037-1_6","DOI":"10.1007\/978-3-030-85037-1_6"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer Publishing Company, Incorporated (2010). https:\/\/doi.org\/10.1007\/978-3-662-03811-6","DOI":"10.1007\/978-3-662-03811-6"},{"key":"6_CR18","unstructured":"Point, G., Herbreteau, F.: The TChecker tool and librairies. https:\/\/github.com\/ticktac-project\/tchecker"},{"key":"6_CR19","unstructured":"Sipser, M.: Introduction to the Theory of Computability, 2nd edn. PWS Publishing Company, Computer Science Series (2006)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7584-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T22:07:30Z","timestamp":1703110050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7584-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819975839","9789819975846"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7584-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/formal-analysis.com\/icfem\/2023\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","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":"13","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":"0","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":"38% - 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","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":"2","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)"}},{"value":"This proceedings includes one invited paper and eight doctoral symposium papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}