Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Timing verification by successive approximation
Information and Computation
Efficient generation of counterexamples and witnesses in symbolic model checking
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
The SLAM project: debugging system software via static analysis
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating-time temporal logic
Journal of the ACM (JACM)
Tree-Like Counterexamples in Model Checking
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Abstract Interpretation of Game Properties
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Detecting Errors Before Reaching Them
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Framework for Scheduler Synthesis
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Extended static checking for haskell
Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Automatic device driver synthesis with termite
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Solving games via three-valued abstraction refinement
Information and Computation
Strategy construction for parity games with imperfect information
Information and Computation
Combining symbolic representations for solving timed games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Abstraction for model checking modular interpreted systems over ATL
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Model-checking behavioral programs
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
A hierarchical approach for the synthesis of stabilizing controllers for hybrid systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Synthesis of reo circuits for implementation of component-connector automata specifications
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Abstraction for model checking modular interpreted systems over ATL
ProMAS'11 Proceedings of the 9th international conference on Programming Multi-Agent Systems
Solving games via three-valued abstraction refinement
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Controllers with minimal observation power (application to timed systems)
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Counterexample-Guided synthesis of observation predicates
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
A constraint-based approach to solving games on infinite graphs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.00 |
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.