{"citation":{"ama":"Henzinger TA, Jhala R, Majumdar R. Counterexample-guided control. In: <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i>. Vol 2719. Springer; 2003:886-902. doi:<a href=\"https://doi.org/10.1007/3-540-45061-0_69\">10.1007/3-540-45061-0_69</a>","ista":"Henzinger TA, Jhala R, Majumdar R. 2003. Counterexample-guided control. Proceedings of the 30th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2719, 886–902.","mla":"Henzinger, Thomas A., et al. “Counterexample-Guided Control.” <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i>, vol. 2719, Springer, 2003, pp. 886–902, doi:<a href=\"https://doi.org/10.1007/3-540-45061-0_69\">10.1007/3-540-45061-0_69</a>.","chicago":"Henzinger, Thomas A, Ranjit Jhala, and Ritankar Majumdar. “Counterexample-Guided Control.” In <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i>, 2719:886–902. Springer, 2003. <a href=\"https://doi.org/10.1007/3-540-45061-0_69\">https://doi.org/10.1007/3-540-45061-0_69</a>.","ieee":"T. A. Henzinger, R. Jhala, and R. Majumdar, “Counterexample-guided control,” in <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i>, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 886–902.","short":"T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 886–902.","apa":"Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2003). Counterexample-guided control. In <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i> (Vol. 2719, pp. 886–902). Eindhoven, The Netherlands: Springer. <a href=\"https://doi.org/10.1007/3-540-45061-0_69\">https://doi.org/10.1007/3-540-45061-0_69</a>"},"type":"conference","oa_version":"None","month":"06","title":"Counterexample-guided control","_id":"4462","publication_identifier":{"isbn":["9783540404934"]},"doi":"10.1007/3-540-45061-0_69","conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2003-07-04","location":"Eindhoven, The Netherlands","start_date":"2003-06-30"},"publication_status":"published","publisher":"Springer","scopus_import":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"886 - 902","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Jhala","full_name":"Jhala, Ranjit","first_name":"Ranjit"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"}],"publist_id":"265","language":[{"iso":"eng"}],"article_processing_charge":"No","date_published":"2003-06-25T00:00:00Z","year":"2003","date_created":"2018-12-11T12:08:58Z","publication":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming","alternative_title":["LNCS"],"volume":2719,"extern":"1","acknowledgement":"This research was supported in part by the DARPA SEC grant F33615-C-98-3614, the ONR grant N00014-02-1-0671, and the NSF grants CCR-9988172, CCR-0085949, and CCR-0225610.","quality_controlled":"1","day":"25","abstract":[{"lang":"eng","text":"A major hurdle in the algorithmic verification and control of systems is the need to find suitable abstract models, which omit enough details to overcome the state-explosion problem, but retain enough details to exhibit satisfaction or controllability with respect to the specification. The paradigm of counterexample-guided abstraction refinement suggests a fully automatic way of finding suitable abstract models: one starts with a coarse abstraction, attempts to verify or control the abstract model, and if this attempt fails and the abstract counterexample does not correspond to a concrete counterexample, then one uses the spurious counterexample to guide the refinement of the abstract model. We present a counterexample-guided refinement algorithm for solving ω-regular control objectives. The main difficulty is that in control, unlike in verification, counterexamples are strategies in a game between system and controller. In the case that the controller has no choices, our scheme subsumes known counterexample-guided refinement algorithms for the verification of ω-regular specifications. Our algorithm is useful in all situations where ω-regular games need to be solved, such as supervisory control, sequential and program synthesis, and modular verification. The algorithm is fully symbolic, and therefore applicable also to infinite-state systems."}],"status":"public","intvolume":"      2719","date_updated":"2024-01-10T11:19:41Z"}