{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:06Z","timestamp":1742914026392,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030587673"},{"type":"electronic","value":"9783030587680"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58768-0_12","type":"book-chapter","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T12:02:48Z","timestamp":1599825768000},"page":"214-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Synthesis of P-Stable Abstractions"],"prefix":"10.1007","author":[{"given":"Anna","family":"Becchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Cimatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enea","family":"Zaffanella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45873-5_6","volume-title":"Hybrid Systems: Computation and Control","author":"R Alur","year":"2002","unstructured":"Alur, R., Dang, T., Ivan\u010di\u0107, F.: Reachability analysis of hybrid systems via predicate abstraction. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, pp. 35\u201348. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45873-5_6"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-36577-X_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Alur","year":"2003","unstructured":"Alur, R., Dang, T., Ivan\u010di\u0107, F.: Counter-example guided predicate abstraction of hybrid systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 208\u2013223. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_15"},{"issue":"2","key":"12_CR3","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)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10009-002-0095-0","volume":"5","author":"T Ball","year":"2003","unstructured":"Ball, T., Podelski, A., Rajamani, S.K.: Boolean and cartesian abstraction for model checking C programs. Int. J. Softw. Tools Technol. Transf. 5(1), 49\u201358 (2003)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-99725-4_11","volume-title":"Static Analysis","author":"A Becchi","year":"2018","unstructured":"Becchi, A., Zaffanella, E.: An efficient abstract domain for not necessarily closed polyhedra. In: Podelski, A. (ed.) SAS 2018. LNCS, vol. 11002, pp. 146\u2013165. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99725-4_11"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2012.10.042","volume":"493","author":"M Benerecetti","year":"2013","unstructured":"Benerecetti, M., Faella, M., Minopoli, S.: Automatic synthesis of switching controllers for linear hybrid systems: safety control. Theor. Comput. Sci. 493, 116\u2013138 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR7","unstructured":"Birkhoff, G.: Lattice Theory, Colloquium Publications, vol. XXV, 3rd edn. American Mathematical Society, Providence (1967)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-15643-4_7","volume-title":"Automated Technology for Verification and Analysis","author":"S Bogomolov","year":"2010","unstructured":"Bogomolov, S., Mitrohin, C., Podelski, A.: Composing reachability analyses of hybrid systems for safety and stability. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 67\u201381. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15643-4_7"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Branicky, M.: Stability of Hybrid Systems: State of the Art, vol. 1, pp. 120\u2013125 (1998)","DOI":"10.1109\/CDC.1997.650600"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TCS.1979.1084637","volume":"CAS\u201326","author":"R Brayton","year":"1979","unstructured":"Brayton, R., Tong, C.: Stability of dynamical systems: a constructive approach. IEEE Trans. Circ. Syst. CAS\u201326, 224\u2013234 (1979)","journal-title":"IEEE Trans. Circ. Syst."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-08867-9_22","volume-title":"Computer Aided Verification","author":"R Cavada","year":"2014","unstructured":"Cavada, R., et al.: The nuXmv symbolic model checker. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 334\u2013342. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_22"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Cavada, R., Cimatti, A., Mover, S., Sessa, M., Cadavero, G., Scaglione, G.: Analysis of relay interlocking systems via SMT-based model checking of switched multi-domain Kirchhoff networks. In: Bj\u00f8rner, N., Gurfinkel, A. (eds.) 2018 Formal Methods in Computer Aided Design, FMCAD 2018, Austin, TX, USA, 30 October-2 November 2018, pp. 1\u20139. IEEE (2018)","DOI":"10.23919\/FMCAD.2018.8603007"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-030-25540-4_21","volume-title":"Computer Aided Verification","author":"A Cimatti","year":"2019","unstructured":"Cimatti, A., Griggio, A., Magnago, E., Roveri, M., Tonetta, S.: Extending nuXmv with timed transition systems and timed temporal properties. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 376\u2013386. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_21"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Graham, R.M., Harrison, M.A., Sethi, R. (eds.) Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1008649901864","volume":"6","author":"P Cousot","year":"1999","unstructured":"Cousot, P., Cousot, R.: Refining model checking by abstract interpretation. Autom. Softw. Eng. 6(1), 69\u201395 (1999)","journal-title":"Autom. Softw. Eng."},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1137\/140988802","volume":"14","author":"P Giesl","year":"2015","unstructured":"Giesl, P., Hafstein, S.F.: Computation and verification of Lyapunov functions. SIAM J. Appl. Dyn. Syst. 14(4), 1663\u20131698 (2015)","journal-title":"SIAM J. Appl. Dyn. Syst."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Liberzon, D.: Switching in Systems and Control. Systems & Control: Foundations & Applications. Birkh\u00e4user (2003)","DOI":"10.1007\/978-1-4612-0017-8"},{"key":"12_CR18","series-title":"PHI Series in Computer Science","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. PHI Series in Computer Science. Prentice Hall, Upper Saddle River (1989)"},{"key":"12_CR19","unstructured":"Mitra , S., Liberzon, D.: Stability of hybrid automata with average dwell time: an invariant approach, vol. 2, pp. 1394\u20131399 (2005)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Papachristodoulou, A., Prajna, S.: On the construction of Lapunov functions using the sum of squares decomposition, vol. 3, pp. 3482\u20133487 (2003)","DOI":"10.1109\/CDC.2002.1184414"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/11730637_38","volume-title":"Hybrid Systems: Computation and Control","author":"A Podelski","year":"2006","unstructured":"Podelski, A., Wagner, S.: Model checking of hybrid systems: from reachability towards stability. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 507\u2013521. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11730637_38"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-75454-1_23","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A Podelski","year":"2007","unstructured":"Podelski, A., Wagner, S.: Region stability proofs for hybrid systems. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 320\u2013335. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75454-1_23"},{"key":"12_CR23","unstructured":"Ravanbakhsh, H., Sankaranarayanan, S.: Counter-example guided synthesis of control Lyapunov functions for switched systems. In: 54th IEEE Conference on Decision and Control, CDC 2015, Osaka, Japan, December 15\u201318, 2015, pp. 4232\u20134239. IEEE (2015)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Chen, X., \u00c1brah\u00e1m, E.: Lyapunov function synthesis using Handelman representations. In: Tarbouriech, S., Krstic, M., (eds.) 9th IFAC Symposium on Nonlinear Control Systems, NOLCOS 2013, Toulouse, France, September 4\u20136, 2013, pp. 576\u2013581. International Federation of Automatic Control (2013)","DOI":"10.3182\/20130904-3-FR-2041.00198"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-319-25141-7_2","volume-title":"Cyber Physical Systems. Design, Modeling, and Evaluation","author":"S Schupp","year":"2015","unstructured":"Schupp, S., et al.: Current challenges in the verification of hybrid systems. In: Berger, C., Mousavi, M.R. (eds.) CyPhy 2015. LNCS, vol. 9361, pp. 8\u201324. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25141-7_2"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58768-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T17:23:54Z","timestamp":1723569834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58768-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030587673","9783030587680"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58768-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.cwi.nl\/sefm2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}