{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:13:46Z","timestamp":1784214826170,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819606160","type":"print"},{"value":"9789819606177","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-96-0617-7_6","type":"book-chapter","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T14:47:23Z","timestamp":1732805243000},"page":"85-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient State Estimation of\u00a0Discrete-Timed Automata"],"prefix":"10.1007","author":[{"given":"Julian","family":"Klein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Kogel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sabine","family":"Glesner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,29]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-38916-0_2","volume-title":"Tests and Proofs","author":"BK Aichernig","year":"2013","unstructured":"Aichernig, B.K., Lorber, F., Ni\u010dkovi\u0107, D.: Time for mutants \u2014 model-based mutation testing with timed automata. In: Veanes, M., Vigan\u00f2, L. (eds.) Tests and Proofs, pp. 20\u201338. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38916-0_2"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-55754-6_1","volume-title":"NASA Formal Methods: 12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11\u201315, 2020, Proceedings","author":"BK Aichernig","year":"2020","unstructured":"Aichernig, B.K., Pferscher, A., Tappler, M.: From passive to active: learning timed automata efficiently. In: Lee, R., Jha, S., Mavridou, A., Giannakopoulou, D. (eds.) NASA Formal Methods: 12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11\u201315, 2020, Proceedings, pp. 1\u201319. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55754-6_1"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BFb0031987","volume-title":"Real-Time: Theory in Practice","author":"R Alur","year":"1992","unstructured":"Alur, R., Dill, D.: The theory of timed automata. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) Real-Time: Theory in Practice, pp. 45\u201373. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0031987"},{"key":"6_CR4","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.) Formal Methods for the Design of Real-Time Systems, pp. 1\u201324. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30080-9_1"},{"key":"6_CR5","doi-asserted-by":"publisher","DOI":"10.1145\/3477030","author":"J An","year":"2021","unstructured":"An, J., Zhan, B., Zhan, N., Zhang, M.: Learning nondeterministic real-time automata. ACM Trans. Embed. Comput. Syst. (2021). https:\/\/doi.org\/10.1145\/3477030","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"6_CR6","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.) Automata, Languages and Programming, pp. 43\u201354. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_4"},{"key":"6_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-014-0220-1","author":"N Bertrand","year":"2015","unstructured":"Bertrand, N., Stainer, A., J\u00e9ron, T., Krichen, M.: A game approach to determinize timed automata. Formal Methods Syst. Design (2015). https:\/\/doi.org\/10.1007\/s10703-014-0220-1","journal-title":"Formal Methods Syst. Design"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Choffrut, C., Goldwurm, M.: Timed automata with periodic clock constraints. J. Autom. Lang. Combinatorics (2000). https:\/\/doi.org\/10.25596\/jalc-2000-371","DOI":"10.25596\/jalc-2000-371"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/11505877_24","volume-title":"Developments in Language Theory","author":"H Gruber","year":"2005","unstructured":"Gruber, H., Holzer, M., Kiehn, A., K\u00f6nig, B.: On timed automata with discrete time \u2013 structural and language theoretical characterization. In: De Felice, C., Restivo, A. (eds.) Developments in Language Theory, pp. 272\u2013283. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11505877_24"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Klein, J., Kogel, P., Glesner, S.: Verifying opacity of discrete-timed automata. In: International Conference on Formal Methods in Software Engineering. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3644033.3644376","DOI":"10.1145\/3644033.3644376"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"C1","DOI":"10.1007\/978-981-99-7584-6_23","volume-title":"Formal Methods and Software Engineering: 24th International Conference on Formal Engineering Methods, ICFEM 2023, Brisbane, QLD, Australia, November 21\u201324, 2023, Proceedings","author":"P Kogel","year":"2023","unstructured":"Kogel, P., Kl\u00f6s, V., Glesner, S.: Correction to: learning mealy machines with\u00a0local timers. In: Li, Y., Tahar, S. (eds.) Formal Methods and Software Engineering: 24th International Conference on Formal Engineering Methods, ICFEM 2023, Brisbane, QLD, Australia, November 21\u201324, 2023, Proceedings, pp. C1\u2013C1. Springer Nature Singapore, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-7584-6_23"},{"key":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2023.10.039","author":"J Komenda","year":"2023","unstructured":"Komenda, J., Lefebvre, D.: On tick automata for distributed timed DESs with synchronisations and minimal time constraints. IFAC-PapersOnLine (2023). https:\/\/doi.org\/10.1016\/j.ifacol.2023.10.039","journal-title":"IFAC-PapersOnLine"},{"key":"6_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.03.003","author":"A Lai","year":"2019","unstructured":"Lai, A., Lahaye, S., Giua, A.: State estimation of max-plus automata with unobservable events. Automatica (2019). https:\/\/doi.org\/10.1016\/j.automatica.2019.03.003","journal-title":"Automatica"},{"key":"6_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2995173","author":"A Lai","year":"2020","unstructured":"Lai, A., Lahaye, S., Giua, A.: Verification of detectability for unambiguous weighted automata. IEEE Trans. Autom. Control (2020). https:\/\/doi.org\/10.1109\/TAC.2020.2995173","journal-title":"IEEE Trans. Autom. Control"},{"key":"6_CR15","unstructured":"Lawford, M.S.: Model Reduction of Discrete Real-Time Systems. University of Toronto (1998)"},{"key":"6_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3064542","author":"J Li","year":"2021","unstructured":"Li, J., Lefebvre, D., Hadjicostis, C.N., Li, Z.: Observers for a class of timed automata based on elapsed time graphs. IEEE Trans. Autom. Control (2021). https:\/\/doi.org\/10.1109\/TAC.2021.3064542","journal-title":"IEEE Trans. Autom. Control"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Lin, L., Su, R., Brandin, B.A., Ware, S., Zhu, Y., Sun, Y.: Synchronous composition of finite interval automata. In: 2019 IEEE 15th International Conference on Control and Automation. IEEE (2019). https:\/\/doi.org\/10.1109\/ICCA.2019.8899529","DOI":"10.1109\/ICCA.2019.8899529"},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-017-9271-x","author":"F Lorber","year":"2017","unstructured":"Lorber, F., Rosenmann, A., Ni\u010dkovi\u0107, D., Aichernig, B.K.: Bounded determinization of timed automata with silent transitions. Real-Time Syst. (2017). https:\/\/doi.org\/10.1007\/s11241-017-9271-x","journal-title":"Real-Time Syst."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Noord, G.V.: Treatment of epsilon moves in subset construction. Comput. Linguist. (2000). https:\/\/doi.org\/10.1162\/089120100561638","DOI":"10.1162\/089120100561638"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Postel, J.: Transmission Control Protocol. RFC 793 (1981). https:\/\/doi.org\/10.17487\/RFC0793, https:\/\/www.rfc-editor.org\/info\/rfc793","DOI":"10.17487\/RFC0793"},{"key":"6_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2170453","author":"A Saboori","year":"2011","unstructured":"Saboori, A., Hadjicostis, C.N.: Opacity-enforcing supervisory strategies via state estimator constructions. IEEE Trans. Autom. Control (2011). https:\/\/doi.org\/10.1109\/TAC.2011.2170453","journal-title":"IEEE Trans. Autom. Control"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Stewart, R.: Stream control transmission protocol. Tech. rep. (2007)","DOI":"10.17487\/rfc4960"},{"key":"6_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-6440-9","volume-title":"Patterns in the Machine: A Software Engineering Guide to Embedded Development","author":"JT Taylor","year":"2021","unstructured":"Taylor, J.T., Taylor, W.T.: Patterns in the Machine: A Software Engineering Guide to Embedded Development. Apress, Berkeley, CA (2021). https:\/\/doi.org\/10.1007\/978-1-4842-6440-9"},{"key":"6_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2023.105013","author":"F Vaandrager","year":"2023","unstructured":"Vaandrager, F., Ebrahimi, M., Bloem, R.: Learning mealy machines with one timer. Inf. Comput. (2023). https:\/\/doi.org\/10.1016\/j.ic.2023.105013","journal-title":"Inf. Comput."},{"key":"6_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-012-0145-z","author":"YC Wu","year":"2013","unstructured":"Wu, Y.C., Lafortune, S.: Comparative analysis of related notions of opacity in centralized and coordinated architectures. Discrete Event Dyn. Syst. (2013). https:\/\/doi.org\/10.1007\/s10626-012-0145-z","journal-title":"Discrete Event Dyn. Syst."},{"key":"6_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2014.02.038","author":"YC Wu","year":"2014","unstructured":"Wu, Y.C., Lafortune, S.: Synthesis of insertion functions for enforcement of opacity security properties. Automatica (2014). https:\/\/doi.org\/10.1016\/j.automatica.2014.02.038","journal-title":"Automatica"},{"key":"6_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-022-00362-8","author":"K Zhang","year":"2022","unstructured":"Zhang, K.: Detectability of labeled weighted automata over monoids. Discrete Event Dyn. Syst. (2022). https:\/\/doi.org\/10.1007\/s10626-022-00362-8","journal-title":"Discrete Event Dyn. Syst."},{"key":"6_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2023.100902","author":"K Zhang","year":"2023","unstructured":"Zhang, K.: A unified concurrent-composition method to state\/event inference and concealment in labeled finite-state automata as discrete-event systems. Ann. Rev. Control. (2023). https:\/\/doi.org\/10.1016\/j.arcontrol.2023.100902","journal-title":"Ann. Rev. Control."},{"key":"6_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114373","author":"K Zhang","year":"2024","unstructured":"Zhang, K.: State-based opacity of labeled real-time automata. Theoret. Comput. Sci. (2024). https:\/\/doi.org\/10.1016\/j.tcs.2023.114373","journal-title":"Theoret. Comput. Sci."}],"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-96-0617-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T15:08:32Z","timestamp":1732806512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0617-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819606160","9789819606177"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0617-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 November 2024","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":"Hiroshima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icfem2024.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}