Act, and the rest will follow: exploiting determinism in planning as satisfiability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
What's decidable about hybrid automata?
Journal of Computer and System Sciences
A machine program for theorem-proving
Communications of the ACM
Bounded Model Checking for Timed Systems
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Tuning SAT Checkers for Bounded Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Information and Computation
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Electronic Notes in Theoretical Computer Science (ENTCS)
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
BACH: Bounded reachAbility CHecker for linear hybrid automata
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Processes and continuous change in a SAT-based planner
Artificial Intelligence
Efficient Proof Engines for Bounded Model Checking of Hybrid Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient interpolant generation in satisfiability modulo theories
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
BACH 2: Bounded reachAbility CHecker for compositional linear hybrid systems
Proceedings of the Conference on Design, Automation and Test in Europe
Efficient scenario verification for hybrid automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Exact incremental analysis of timed automata with an SMT-solver
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Proving and explaining the unfeasibility of message sequence charts for hybrid systems
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
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
Formal correctness, safety, dependability, and performance analysis of a satellite
Proceedings of the 34th International Conference on Software Engineering
Planning as satisfiability: Heuristics
Artificial Intelligence
Confidence bounds for statistical model checking of probabilistic hybrid systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed 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
SMT-based scenario verification for hybrid systems
Formal Methods in System Design
Lemma localization: a practical method for downsizing SMT-interpolants
Proceedings of the Conference on Design, Automation and Test in Europe
Time-aware relational abstractions for hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
Industrial systems of practical relevance can be often characterized in terms of discrete control variables and real-valued physical variables, and can therefore be modeled as hybrid automata. Unfortunately, continuity of the physical behaviour over time, or triangular constraints, must often be assumed, which yield an undecidable class of hybrid automata. In this paper, we propose a technique for bounded reachability of linear hybrid automata, based on the reduction of a bounded reachability problem to a MathSAT problem, i.e. satisfiability of a boolean combination of propositional variables and mathematical constraints. The MathSAT solver can be used to check the existence (or absence) of paths of bounded length. The approach is very similar in spirit to SAT-based bounded model checking; furthermore, the ability to reason directly about real variables gives computational leverage over discretization-based methods. Despite the undecidability of the general problem, the proposed method is able to provide valuable information on large designs of practical relevance.