Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Compiling Real-Time Specifications into Extended Automata
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Automated Derivation of Time Bounds in Uniprocessor Concurrent Systems
IEEE Transactions on Software Engineering
Timing Analysis of Ada Tasking Programs
IEEE Transactions on Software Engineering - Special issue: best papers of the 1996 international symposium on software testing and analysis ISSTA'96
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
IEEE Transactions on Software Engineering
Applications of non-Markovian stochastic Petri nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A Modeling Framework to Implement Preemption Policies in Non-Markovian SPNs
IEEE Transactions on Software Engineering
ACM Computing Surveys (CSUR)
Static Analysis and Dynamic Steering of Time-Dependent Systems
IEEE Transactions on Software Engineering
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets
IEEE Transactions on Software Engineering
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
TIMES - A Tool for Modelling and Implementation of Embedded Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
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
M-timed Petri nets, priorities, preemptions, and performance evaluation of Petri nets
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Suspension Automata: A Decidable Class of Hybrid Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Preemptive Multiprocessor Scheduling Anomalies
IPDPS '02 Proceedings of the 16th International Symposium on Parallel and Distributed Processing
Exploiting Temporal Uncertainty in the Distributed Simulation of Time Petri Nets
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
IEEE Transactions on Software Engineering
Time Petri Nets for Modelling and Analysis of Biochemical Networks
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Extreme Runtimes of Schedules Modelled by Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches
Discrete Event Dynamic Systems
When are Timed Automata weakly timed bisimilar to Time Petri Nets?
Theoretical Computer Science
A Tailored V-Model Exploiting the Theory of Preemptive Time Petri Nets
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
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
Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Automatic Code Generation from Real-Time Systems Specifications
RSP '09 Proceedings of the 2009 IEEE/IFIP International Symposium on Rapid System Prototyping
Formal verification of real-time systems with preemptive scheduling
Real-Time Systems
Case study on distributed and fault tolerant system modeling based on timed automata
Journal of Systems and Software
Soundness for S- and A-timed workflow nets is undecidable
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
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
Quantitative evaluation of time-dependent Petri nets and applications to biochemical networks
Natural Computing: an international journal
A framework for simulation and symbolic state space analysis of non-markovian models
SAFECOMP'11 Proceedings of the 30th international conference on Computer safety, reliability, and security
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Romeo: a tool for analyzing time petri nets
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Module-based architecture for a periodic job-shop scheduling problem
Computers & Mathematics with Applications
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Time Petri Nets for Modelling and Analysis of Biochemical Networks
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Extreme Runtimes of Schedules Modelled by Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Efficient computation of quantitative properties of real-time preemptive systems
International Journal of Critical Computer-Based Systems
Development of a Schedulability Analysis Framework Based on pTPN and UPPAAL with Stopwatches
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
Integer parameter synthesis for timed automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Non-markovian analysis for model driven engineering of real-time software
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
Hi-index | 0.00 |
Abstract--A modeling notation is introduced which extends Time Petri Nets with an additional mechanism of resource assignment making the progress of timed transitions be dependent on the availability of a set of preemptable resources. The resulting notation, which we call Preemptive Time Petri Nets, permits natural description of complex real-time systems running under preemptive scheduling, with periodic, sporadic, and one-shot processes, with nondeterministic execution times, with semaphore synchronizations and precedence relations deriving from internal task sequentialization and from interprocess communication, running on multiple processors. A state space analysis technique is presented which supports the validation of Preemptive Time Petri Net models, combining tight schedulability analysis with exhaustive verification of the correctness of logical sequencing. The analysis technique partitions the state space in equivalence classes in which timing constraints are represented in the form of Difference Bounds Matrixes. This permits it to maintain a polynomial complexity in the representation and derivation of state classes, but it does not tightly encompass the constraints deriving from preemptive behavior, thus producing an enlarged representation of the state space. False behaviors deriving from the approximation can be cleaned-up through an algorithm which provides a necessary and sufficient condition for the feasibility of a behavior along with a tight estimation of its timing profile.