{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:57:17Z","timestamp":1740099437221,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030255398"},{"type":"electronic","value":"9783030255404"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25540-4_16","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T11:02:35Z","timestamp":1562929355000},"page":"297-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Membership-Based Synthesis of Linear Hybrid Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2936-5719","authenticated-orcid":false,"given":"Miriam","family":"Garc\u00eda Soto","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2985-7724","authenticated-orcid":false,"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3658-1065","authenticated-orcid":false,"given":"Christian","family":"Schilling","sequence":"additional","affiliation":[]},{"given":"Luka","family":"Zeleznik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-57318-6_30","volume-title":"Hybrid Systems","author":"R Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H.: Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Nerode, A., Ravn, A.P., Rischel, H. (eds.) HS 1991-1992. LNCS, vol. 736, pp. 209\u2013229. Springer, Heidelberg (1993). \n                      https:\/\/doi.org\/10.1007\/3-540-57318-6_30"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Alur, R., Kurshan, R.P., Viswanathan, M.: Membership questions for timed and hybrid automata. In: RTSS, pp. 254\u2013263. IEEE Computer Society (1998). \n                      https:\/\/doi.org\/10.1109\/REAL.1998.739751","DOI":"10.1109\/REAL.1998.739751"},{"issue":"2","key":"16_CR3","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). \n                      https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"16_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1\u20132), 3\u201321 (2008). \n                      https:\/\/doi.org\/10.1016\/j.scico.2007.08.001","journal-title":"Sci. Comput. Program."},{"issue":"10","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1109\/TAC.2005.856667","volume":"50","author":"A Bemporad","year":"2005","unstructured":"Bemporad, A., Garulli, A., Paoletti, S., Vicino, A.: A bounded-error approach to piecewise affine system identification. IEEE Trans. Autom. Control 50(10), 1567\u20131580 (2005). \n                      https:\/\/doi.org\/10.1109\/TAC.2005.856667","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica 10(2), 112\u2013122 (1973)","journal-title":"Cartographica"},{"issue":"16","key":"16_CR7","doi-asserted-by":"publisher","first-page":"344","DOI":"10.3182\/20120711-3-BE-2027.00332","volume":"45","author":"A Garulli","year":"2012","unstructured":"Garulli, A., Paoletti, S., Vicino, A.: A survey on switched and piecewise affine system identification. IFAC Proc. Vol. 45(16), 344\u2013355 (2012). \n                      https:\/\/doi.org\/10.3182\/20120711-3-BE-2027.00332","journal-title":"IFAC Proc. Vol."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-71493-4_21","volume-title":"Hybrid Systems: Computation and Control","author":"R Grosu","year":"2007","unstructured":"Grosu, R., Mitra, S., Ye, P., Entcheva, E., Ramakrishnan, I.V., Smolka, S.A.: Learning cycle-linear hybrid automata for excitable cells. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 245\u2013258. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71493-4_21"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/1049-9652(91)90056-P","volume":"53","author":"SL Hakimi","year":"1991","unstructured":"Hakimi, S.L., Schmeichel, E.F.: Fitting polygonal functions to a set of points in the plane. CVGIP Graph. Model. Image Process. 53(2), 132\u2013136 (1991). \n                      https:\/\/doi.org\/10.1016\/1049-9652(91)90056-P","journal-title":"CVGIP Graph. Model. Image Process."},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Hashambhoy, Y., Vidal, R.: Recursive identification of switched ARX models with unknown number of models and unknown orders. In: CDC, pp. 6115\u20136121 (2005). \n                      https:\/\/doi.org\/10.1109\/CDC.2005.1583140","DOI":"10.1109\/CDC.2005.1583140"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: Inan, M.K., Kurshan, R.P. (eds.) Verification of Digital and Hybrid Systems. NATO ASI Series (Series F: Computer and Systems Sciences), vol. 170, pp. 265\u2013292. Springer, Berlin, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/978-3-642-59615-5_13","DOI":"10.1007\/978-3-642-59615-5_13"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Lamrani, I., Banerjee, A., Gupta, S.K.S.: HyMn: mining linear hybrid automata from input output traces of cyber-physical systems. In: ICPS, pp. 264\u2013269. IEEE (2018). \n                      https:\/\/doi.org\/10.1109\/ICPHYS.2018.8387670","DOI":"10.1109\/ICPHYS.2018.8387670"},{"key":"16_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0017-8","volume-title":"Switching in Systems and Control","author":"D Liberzon","year":"2003","unstructured":"Liberzon, D.: Switching in Systems and Control. Birkh\u00e4user, Boston (2003). \n                      https:\/\/doi.org\/10.1007\/978-1-4612-0017-8"},{"key":"16_CR14","first-page":"3585","volume":"13","author":"DL Ly","year":"2012","unstructured":"Ly, D.L., Lipson, H.: Learning symbolic representations of hybrid dynamical systems. JMLR 13, 3585\u20133618 (2012). \n                      http:\/\/dl.acm.org\/citation.cfm?id=2503356","journal-title":"JMLR"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Medhat, R., Ramesh, S., Bonakdarpour, B., Fischmeister, S.: A framework for mining hybrid automata from input\/output traces. In: EMSOFT, pp. 177\u2013186. IEEE (2015). \n                      https:\/\/doi.org\/10.1109\/EMSOFT.2015.7318273","DOI":"10.1109\/EMSOFT.2015.7318273"},{"key":"16_CR16","unstructured":"Niggemann, O., Stein, B., Vodencarevic, A., Maier, A., Kleine B\u00fcning, H.: Learning behavior models for hybrid timed systems. In: AAAI. AAAI Press (2012). \n                      http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI12\/paper\/view\/4993"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Ozay, N.: An exact and efficient algorithm for segmentation of ARX models. In: ACC, pp. 38\u201341. IEEE (2016). \n                      https:\/\/doi.org\/10.1109\/ACC.2016.7524888","DOI":"10.1109\/ACC.2016.7524888"},{"issue":"2\u20133","key":"16_CR18","doi-asserted-by":"publisher","first-page":"242","DOI":"10.3166\/ejc.13.242-260","volume":"13","author":"S Paoletti","year":"2007","unstructured":"Paoletti, S., Juloski, A.L., Ferrari-Trecate, G., Vidal, R.: Identification of hybrid systems: a tutorial. Eur. J. Control 13(2\u20133), 242\u2013260 (2007). \n                      https:\/\/doi.org\/10.3166\/ejc.13.242-260","journal-title":"Eur. J. Control"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/00207179208934230","volume":"55","author":"A Skeppstedt","year":"1992","unstructured":"Skeppstedt, A., Lennart, L., Millnert, M.: Construction of composite models from observed data. Int. J. Control 55(1), 141\u2013152 (1992). \n                      https:\/\/doi.org\/10.1080\/00207179208934230","journal-title":"Int. J. Control"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Summerville, A., Osborn, J.C., Mateas, M.: CHARDA: causal hybrid automata recovery via dynamic analysis. In: IJCAI, pp. 2800\u20132806. ijcai.org (2017). \n                      https:\/\/doi.org\/10.24963\/ijcai.2017\/390","DOI":"10.24963\/ijcai.2017\/390"},{"key":"16_CR21","unstructured":"Verwer, S.: Efficient identification of timed automata: theory and practice. Ph.D. thesis, Delft University of Technology, Netherlands (2010). \n                      http:\/\/resolver.tudelft.nl\/uuid:61d9f199-7b01-45be-a6ed-04498113a212"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Vidal, R., Anderson, B.D.O.: Recursive identification of switched ARX hybrid models: exponential convergence and persistence of excitation. In: CDC, vol. 1, pp. 32\u201337 (2004). \n                      https:\/\/doi.org\/10.1109\/CDC.2004.1428602","DOI":"10.1109\/CDC.2004.1428602"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25540-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T11:04:26Z","timestamp":1562929466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25540-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255398","9783030255404"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25540-4_16","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":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"258","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":"67","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":"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":"9","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}