{"date_created":"2018-12-11T12:02:16Z","publist_id":"3406","pubrep_id":"100","doi":"10.1007/978-3-642-27940-9_29","date_published":"2012-01-01T00:00:00Z","intvolume":"      7148","month":"01","type":"conference","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1405"}]},"day":"01","quality_controlled":"1","date_updated":"2023-09-07T11:36:36Z","oa_version":"Submitted Version","page":"445 - 460","file_date_updated":"2020-07-14T12:46:05Z","alternative_title":["LNCS"],"year":"2012","publisher":"Springer","ec_funded":1,"_id":"3251","file":[{"relation":"main_file","file_id":"4759","checksum":"f2f0d55efa32309ad1fe65a5fcaad90c","file_name":"IST-2012-100-v1+1_Ideal_abstractions_for_well-structured_transition_systems.pdf","creator":"system","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:09:35Z","file_size":217104,"date_updated":"2020-07-14T12:46:05Z"}],"abstract":[{"text":"Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems equipped with a well-quasi-ordering on states that is also a simulation relation. WSTS are an attractive target for formal analysis because there exist generic algorithms that decide interesting verification problems for this class. Among the most popular algorithms are acceleration-based forward analyses for computing the covering set. Termination of these algorithms can only be guaranteed for flattable WSTS. Yet, many WSTS of practical interest are not flattable and the question whether any given WSTS is flattable is itself undecidable. We therefore propose an analysis that computes the covering set and captures the essence of acceleration-based algorithms, but sacrifices precision for guaranteed termination. Our analysis is an abstract interpretation whose abstract domain builds on the ideal completion of the well-quasi-ordered state space, and a widening operator that mimics acceleration and controls the loss of precision of the analysis. We present instances of our framework for various classes of WSTS. Our experience with a prototype implementation indicates that, despite the inherent precision loss, our analysis often computes the precise covering set of the analyzed system.","lang":"eng"}],"citation":{"ama":"Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition systems. In: Vol 7148. Springer; 2012:445-460. doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">10.1007/978-3-642-27940-9_29</a>","apa":"Zufferey, D., Wies, T., &#38; Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">https://doi.org/10.1007/978-3-642-27940-9_29</a>","chicago":"Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">https://doi.org/10.1007/978-3-642-27940-9_29</a>.","ieee":"D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.","ista":"Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 445–460.","short":"D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460.","mla":"Zufferey, Damien, et al. <i>Ideal Abstractions for Well Structured Transition Systems</i>. Vol. 7148, Springer, 2012, pp. 445–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-27940-9_29\">10.1007/978-3-642-27940-9_29</a>."},"ddc":["000","005"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"title":"Ideal abstractions for well structured transition systems","author":[{"full_name":"Zufferey, Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien"},{"last_name":"Wies","full_name":"Wies, Thomas","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"publication_status":"published","oa":1,"conference":{"end_date":"2012-01-24","location":"Philadelphia, PA, USA","start_date":"2012-01-22","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"has_accepted_license":"1","acknowledgement":"This research was supported in part by the European Research Council (ERC) Advanced Investigator Grant QUAREM and by the Austrian Science Fund (FWF) project S11402-N23.","volume":7148,"status":"public","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}]}