A new polynomial-time algorithm for linear programming
Combinatorica
MINOS(IIS): infeasibility analysis using MINOS
Computers and Operations Research
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Automatic analysis of hybrid systems
Automatic analysis of hybrid systems
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Model checking
Automatic predicate abstraction of C programs
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Counterexample-guided predicate abstraction of hybrid systems
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Hybrid Systems: Computation and Control: 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings (Lecture Notes in Computer Science)
Refining abstractions of hybrid systems using counterexample fragments
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
ACM Computing Surveys (CSUR)
Refinement of Trace Abstraction
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Symbolic reachability analysis of lazy linear hybrid automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Composing reachability analyses of hybrid systems for safety and stability
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A dynamic algorithm for approximate flow computations
Proceedings of the 14th international conference on Hybrid systems: computation and control
Theoretical Computer Science
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
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Synthesis of quantized feedback control software for discrete time linear hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Model checking of hybrid systems using shallow synchronization
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
IIS-Guided DFS for efficient bounded reachability analysis of linear hybrid automata
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Software model checking for people who love automata
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
This paper introduces iterative relaxation abstraction (IRA), a new method for reachability analysis of LHA that aims to improve scalability by combining the capabilities of current tools for analysis of low-dimensional LHA with the power of linear programming (LP) for large numbers of constraints and variables. IRA is inspired by the success of counterexample guided abstraction refinement (CEGAR) techniques in verification of discrete systems. On each iteration, a low-dimensional LHA called a relaxation abstraction is constructed using a subset of the continuous variables from the original LHA. Hybrid system reachability analysis then generates a regular language called the discrete path abstraction containing all possible counterexamples (paths to the bad locations) in the relaxation abstraction. If the discrete path abstraction is non-empty, a particular counterexample is selected and LP infeasibility analysis determines if the counterexample is spurious using the constraints along the path from the original high-dimensional LHA. If the counterexample is spurious, LP techniques identify an irreducible infeasible subset (IIS) of constraints from which the set of continuous variables is selected for the the construction of the next relaxation abstraction. IRA stops if the discrete path abstraction is empty or a legitimate counterexample is found. The effectiveness of the approach is illustrated with an example.