Analyzing safety and fault tolerance using time Petri nets
Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT) on Formal Methods and Software, Vol.2: Colloquium on Software Engineering (CSE)
Theoretical Computer Science
Symbolic approximations for verifying real-time systems
Symbolic approximations for verifying real-time systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Automata, Languages, and Machines
Automata, Languages, and Machines
Variable Independence, Quantifier Elimination, and Constraint Representations
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Model Checking of Real-Time Reachability Properties Using Abstractions
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Compositional and symbolic model-checking of real-time systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Ameliorating the state explosion problem
Ameliorating the state explosion problem
| Hi-index | 0.00 |
Existing model checking tools for infinite state systems, such as UPPAAL, HYTECH and KRONOS, use symbolic forward analysis, a possibly nonterminating procedure. We give termination criteria that allow us to reason compositionally about systems defined with asynchronous parallel composition; we can prove the termination of symbolic forward analysis for a composed system from the syntactic conditions satisfied by the component systems.Our results apply to nonlinear hybrid systems; in particular to rectangular hybrid systems, timed automata and o-minimal systems. In the case of integer-valued systems we give negative results: forward analysis is not well-suited for this class of infinite-state systems.