Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Timed Automata with Asynchronous Processes: Schedulability and Decidability
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The Impressive Power of Stopwatches
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Time Constraints Verification Methods Based on Time Petri Nets
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Timed State Space Analysis of Real-Time Preemptive Systems
IEEE Transactions on Software Engineering
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
We propose in this paper an algorithm making it possible an efficient time analysis of the state space of preemptive real-time systems modelled using time Petri nets with inhibitor arcs. For this effect, we discuss how to determine linear and quantitative properties of the remote model from its reachability graph. Then, we propose an algorithm to compute an approximation of the minimal and the maximal time distances of any firing sequence. Contrarily to other techniques, our algorithm enjoys a linear complexity time cost and can be performed on the fly when building the reachability graph without requiring to extend the original model with observers.