Using HyTech to Synthesize Control Parameters for a Steam Boiler
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reachability for linear hybrid automata using iterative relaxation abstraction
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Parameter Synthesis for Hybrid Systems with an Application to Simulink Models
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Parameter Synthesis in Nonlinear Dynamical Systems: Application to Systems Biology
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
European Train Control System: A Case Study in Formal Verification
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Behavioral cartography of timed automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Synthesis of timing parameters satisfying safety properties
RP'11 Proceedings of the 5th international conference on Reachability problems
Parametric verification and test coverage for hybrid automata using the inverse method
RP'11 Proceedings of the 5th international conference on Reachability problems
Hierarchical reasoning for the verification of parametric systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
On Parameter Synthesis by Parallel Model Checking
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Bounded model checking for parametric timed automata
Transactions on Petri Nets and Other Models of Concurrency V
Hierarchical reasoning and model generation for the verification of parametric hybrid systems
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
Our goal is to find the set of parameters for which a given linear hybrid automaton does not reach a given set of bad states. The problem is known to be semi-solvable (if the algorithm terminates the result is correct) by introducing the parameters as state variables and computing the set of reachable states. This is usually too expensive, however, and in our experiments only possible for very simple systems with few parameters. We propose an adaptation of counterexample-guided abstraction refinement (CEGAR) with which one can obtain an underapproximation of the set of good parameters using linear programming. The adaptation is generic and can be applied on top of any CEGAR method where the counterexamples correspond to paths in the concrete system. For each counterexample, the cost incurred by underapproximating the parameters is polynomial in the number of variables, parameters, and the length of counterexample. We identify a syntactic condition for which the approach is complete in the sense that the underapproximation is empty only if the problem has no solution. Experimental results are provided for two CEGAR methods, a simple discrete version and iterative relaxation abstraction (IRA), both of which show a drastic improvement in performance compared to standard reachability.