{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:51:56Z","timestamp":1743079916502,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031199912"},{"type":"electronic","value":"9783031199929"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19992-9_17","type":"book-chapter","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T09:12:06Z","timestamp":1666429926000},"page":"266-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning and Characterizing Fully-Ordered Lattice Automata"],"prefix":"10.1007","author":[{"given":"Dana","family":"Fisman","sequence":"first","affiliation":[]},{"given":"Sagi","family":"Saadon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-15375-4_6","volume-title":"CONCUR 2010 - Concurrency Theory","author":"Fides Aarts","year":"2010","unstructured":"Aarts, Fides, Vaandrager, Frits: Learning I\/O automata. In: Gastin, Paul, Laroussinie, Fran\u00e7ois (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 71\u201385. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_6"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"17_CR3","unstructured":"Angluin, D., Antonopoulos, T., Fisman, D.: Strongly unambiguous B\u00fcchi automata are polynomially predictable with membership queries. In: 28th EACSL Annual Conference on Computer Science Logic (CSL) (2020)"},{"key":"17_CR4","unstructured":"Angluin, D., Eisenstat, S., Fisman, D.: Learning regular languages via alternating automata. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI) (2015)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Fisman, D.: Learning regular omega languages. In: Proceedings of the 25th International Conference on Algorithmic Learning Theory (ALT) (2014)","DOI":"10.1007\/978-3-319-11662-4_10"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bakhirkin, A., Ferr\u00e8re, T., Maler, O.: Efficient parametric identification for STL. In: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (HSCC), pp. 177\u2013186 (2018)","DOI":"10.1145\/3178126.3178132"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-23021-4_1","volume-title":"Algebraic Informatics","author":"Borja Balle","year":"2015","unstructured":"Balle, Borja, Mohri, Mehryar: Learning weighted automata. In: Maletti, Andreas (ed.) CAI 2015. LNCS, vol. 9270, pp. 1\u201321. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23021-4_1"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/337244.337257","volume":"47","author":"A Beimel","year":"2000","unstructured":"Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM 47(3), 506\u2013530 (2000)","journal-title":"J. ACM"},{"key":"17_CR9","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), vol. 9, pp. 1004\u20131009 (2009)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/10722167_34","volume-title":"Computer Aided Verification","author":"William Chan","year":"2000","unstructured":"Chan, William: Temporal-logic queries. In: Emerson, E. Allen., Sistla, Aravinda Prasad (eds.) CAV 2000. LNCS, vol. 1855, pp. 450\u2013463. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_34"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-54577-5_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Samuel Drews","year":"2017","unstructured":"Drews, Samuel, D\u2019Antoni, Loris: Learning symbolic automata. In: Legay, Axel, Margaria, Tiziana (eds.) TACAS 2017. LNCS, vol. 10205, pp. 173\u2013189. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_10"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Easterbrook, S., et al.: \/spl chi\/Chek: a model checker for multi-valued reasoning. In: Proceedings of the 25th International Conference on Software Engineering, pp. 804\u2013805. IEEE (2003)","DOI":"10.1109\/ICSE.2003.1201295"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"Susanne Graf","year":"1997","unstructured":"Graf, Susanne, Saidi, Hassen: Construction of abstract state graphs with PVS. In: Grumberg, Orna (ed.) CAV 1997. LNCS, vol. 1254, pp. 72\u201383. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63166-6_10"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2631915","volume":"16","author":"S Halamish","year":"2015","unstructured":"Halamish, S., Kupferman, O.: Minimizing deterministic lattice automata. ACM Trans. Comput. Log. 16(1), 1\u201321 (2015)","journal-title":"ACM Trans. Comput. Log."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A.: From Boolean to quantitative notions of correctness. In Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 157\u2013158. POPL (2010)","DOI":"10.1145\/1706299.1706319"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10009-022-00656-0","volume":"24","author":"Samuel Huang","year":"2022","unstructured":"Huang, Samuel, Cleaveland, Rance: Temporal-logic query checking over finite data streams. Int. J. Softw. Tools Technol. Transfer 24(3), 473\u2013492 (2022). https:\/\/doi.org\/10.1007\/s10009-022-00656-0","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.tcs.2008.03.010","volume":"404","author":"A Hussain","year":"2008","unstructured":"Hussain, A., Huth, M.: On model checking multiple hybrid views. Theor. Comput. Sci. 404(3), 186\u2013201 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Jak\u0161i\u0107, S., Bartocci, E., Grosu, R., Ni\u010dkovi\u0107, D.: An algebraic framework for runtime verification. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 37(11), 2233\u20132243 (2018)","DOI":"10.1109\/TCAD.2018.2858460"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11817949_14","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"Viraj Kumar","year":"2006","unstructured":"Kumar, Viraj, Madhusudan, P.., Viswanathan, Mahesh: Minimization, learning, and conformance testing of Boolean programs. In: Baier, Christel, Hermanns, Holger (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 203\u2013217. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_14"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Orna Kupferman","year":"2007","unstructured":"Kupferman, Orna, Lustig, Yoad: Lattice automata. In: Cook, Byron, Podelski, Andreas (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 199\u2013213. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69738-1_14"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-030-88494-9_8","volume-title":"Runtime Verification","author":"Konstantinos Mamouras","year":"2021","unstructured":"Mamouras, Konstantinos, Chattopadhyay, Agnishom, Wang, Zhifu: A compositional framework for\u00a0quantitative online monitoring over\u00a0continuous-time signals. In: Feng, Lu., Fisman, Dana (eds.) RV 2021. LNCS, vol. 12974, pp. 142\u2013163. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88494-9_8"},{"issue":"2","key":"17_CR22","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"key":"17_CR23","first-page":"112","volume":"57","author":"J Myhill","year":"1957","unstructured":"Myhill, J.: Finite automata and the representation of events. WADD Tech. Rep. 57, 112\u2013137 (1957)","journal-title":"WADD Tech. Rep."},{"issue":"4","key":"17_CR24","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9(4), 541\u2013544 (1958)","journal-title":"Proc. Am. Math. Soc."},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Nitay, D., Fisman, D., Ziv-Ukelson, M.: Learning of structurally unambiguous probabilistic grammars. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, No. 10, pp. 9170\u20139178 (2021)","DOI":"10.1609\/aaai.v35i10.17107"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 411\u2013420 (1989)","DOI":"10.1145\/73007.73047"},{"key":"17_CR27","unstructured":"Sakakibara, V.: Learning context-free grammars from structural data in polynomial time. In: Proceedings of the First Annual Workshop on Computational Learning Theory (COLT) (1988)"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"Muzammil Shahbaz","year":"2009","unstructured":"Shahbaz, Muzammil, Groz, Roland: Inferring Mealy machines. In: Cavalcanti, Ana, Dams, Dennis R.. (eds.) FM 2009. LNCS, vol. 5850, pp. 207\u2013222. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05089-3_14"},{"key":"17_CR29","unstructured":"Streb, J., Alexander, P.: Using a lattice of coalgebras for heterogeneous model composition. In: Proceedings of the MoDELS Workshop on Multi-Paradigm Modeling, pp. 27\u201338 (2006)"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2) (2017)","DOI":"10.1145\/2967606"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-57201-3_5","volume-title":"Coalgebraic Methods in Computer Science","author":"Gerco van Heerdt","year":"2020","unstructured":"van Heerdt, Gerco, Sammartino, Matteo, Silva, Alexandra: Learning automata with side-effects. In: Petri\u015fan, Daniela, Rot, Jurriaan (eds.) CMCS 2020. LNCS, vol. 12094, pp. 68\u201389. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57201-3_5"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19992-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T09:14:23Z","timestamp":1666430063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19992-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031199912","9783031199929"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19992-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2022\/","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":"81","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":"21","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":"5","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":"26% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic, the conference was held virtually. Additional to the 26 papers, 1 invited talk is included.","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)"}}]}}