Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Timed State Space Analysis of Real-Time Preemptive Systems
IEEE Transactions on Software Engineering
A Translation Based Method for the Timed Analysis of Scheduling Extended Time Petri Nets
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Romeo: a tool for analyzing time petri nets
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the state-space of the system, modeled as a time Petri net with stopwatches, exactly and efficiently, by the use of Difference Bounds Matrices (DBM) whenever possible and automatically switching to more time and memory consuming general (convex) polyhedra only when required. We propose a necessary and sufficient condition for the need of general polyhedra. We give experimental results comparing our implementation of the method to a full DBM over-approximation and to an exact computation with only general polyhedra.