Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A causal semantics for time Petri nets
Theoretical Computer Science
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
Automatic Symbolic Verification of Embedded 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
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
ACSR: An Algebra of Communicating Shared Resources with Dense Time and Priorities
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Suspension Automata: A Decidable Class of Hybrid Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Reducing the number of clock variables of timed automata
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
A Framework for Scheduler Synthesis
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
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
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
A generic approach to schedulability analysis of real-time tasks
Nordic Journal of Computing
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
State space computation and analysis of Time Petri Nets
Theory and Practice of Logic Programming
Schedulability analysis of fixed-priority systems using timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches
Discrete Event Dynamic Systems
Schedulability analysis using two clocks
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Romeo: a tool for analyzing time petri nets
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Symbolic unfolding of parametric stopwatch Petri nets
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Multiprocessor schedulability analyser
Proceedings of the 2011 ACM Symposium on Applied Computing
A formal approach to design and verification of two-level hierarchical scheduling systems
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
Compositional specification of real time embedded systems by priority time Petri Nets
The Journal of Supercomputing
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
Theoretical Computer Science
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Symbolic unfolding of parametric stopwatch Petri nets
Formal Methods in System Design
Hi-index | 0.00 |
In this paper, we propose a method for the verification of timed properties for real-time systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time Petri net, is first translated into a linear hybrid automaton to which it is time-bisimilar. Timed properties can then be verified using HYTECH. The efficiency of this approach leans on two major points: first, the translation features a minimization of the number of variables (clocks) of the resulting automaton, which is a critical parameter for the efficiency of the ensuing verification. Second, the translation is performed by an over-approximating algorithm, which is based on Difference Bound Matrix and therefore efficient, that nonetheless produces a time-bisimilar automaton despite the over-approximation. The proposed modeling and verification method are generic enough to account for many scheduling policies. In this paper, we specifically show how to deal with Fixed Priority and Earliest Deadline First policies, with the possibility of using Round-Robin for tasks with the same priority. We have implemented the method and give some experimental results illustrating its efficiency.