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
Computing Accumulated Delays in Real-time Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
What Will Be Eventually True of Polynomial Hybrid Automata?
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
On Hybrid Systems and the Modal µ-calculus
Hybrid Systems V
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
Lateral Inhibition through Delta-Notch Signaling: A Piecewise Affine Hybrid Model
HSCC '01 Proceedings of the 4th 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
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
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
Property Driven Three-Valued Model Checking on Hybrid Automata
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
| Hi-index | 0.00 |
Abstraction/refinement methods play a central role in the analysis of hybrid automata, that are rarely decidable. Soundness (of evaluated properties) is a major challenge for these methods, since abstractions can introduce unrealistic behaviors. In this paper, we consider the definition of a three-valued semantics for μ -calculus on abstractions of hybrid automata. Our approach relies on two steps: First, we develop a framework that is general in the sense that it provides a preservation result that holds for several possible semantics of the modal operators. In a second step, we instantiate our framework to two particular abstractions. To this end, a key issue is the consideration of both over- and under-approximated reachability analysis, while classic simulation-based abstractions rely only on overapproximations, and limit the preservation to the universal (μ -calculus') fragment. To specialize our general result, we consider (1) so-called discrete bounded bisimulation abstractions, and (2) modal abstractions based on may/must transitions.