CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Theoretical Computer Science
Kleene's three valued logics and their children
Fundamenta Informaticae
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Logic: from foundations to applications
Model checking
What Will Be Eventually True of Polynomial Hybrid Automata?
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Verification of Reactive Systems: Formal Methods and Algorithms
Verification of Reactive Systems: Formal Methods and Algorithms
Automated symbolic reachability analysis: with application to delta-notch signaling automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Algorithmic algebraic model checking i: challenges from systems biology
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Safety verification of hybrid systems by constraint propagation based abstraction refinement
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
A Uniform Approach to Three-Valued Semantics for μ-Calculus on Abstractions of Hybrid Automata
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Property Driven Three-Valued Model Checking on Hybrid Automata
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Specifications for decidable hybrid games
Theoretical Computer Science
Hi-index | 0.00 |
Current symbolic techniques for the automated reasoning over undecidable hybrid automata, force one to choose between the refinement of either an overapproximation or an underapproximation of the set of reachable states. When the analysis of branching time temporal properties is considered, the literature has developed a number of abstractions techniques based on the simulation preorder, that allow the preservation of only true universally quantified formulæ.This paper suggests a way to surmount these difficulties by defining a succession of abstractions of hybrid automata, which not only (1) allow the detection and the refinement of both over- and under-approximated reachable sets symmetrically, but also (2) preserves the full set of branching time temporal properties (when interpreted on a dense time domain). Moreover, our approach imposes on the corresponding set of abstractions a desirable monotonicity property with respect to the set of model-checked formulaæ.