Theory of linear and integer programming
Theory of linear and integer programming
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
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
State class constructions for branching analysis of time Petri nets
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
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,
Formal verification of real-time systems with preemptive scheduling
Real-Time Systems
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
Time properties verification framework for UML-MARTE safety critical real-time systems
ECMFA'12 Proceedings of the 8th European conference on Modelling Foundations and Applications
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Efficient computation of quantitative properties of real-time preemptive systems
International Journal of Critical Computer-Based Systems
Design, Analysis and Verification of Real-Time Systems Based on Time Petri Net Refinement
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Discrete Event Dynamic Systems
Symbolic unfolding of parametric stopwatch Petri nets
Formal Methods in System Design
| Hi-index | 0.00 |
Several extensions of Time Petri nets (TPNs) have been proposed for modeling suspension and resumption of actions in timed systems. We first introduce a simple class of TPNs extended with stopwatches (SwTPNs), and present a semi-algorithm for building exact representations of the behavior of SwTPNs, based on the known state class method for Time Petri nets. Then, we prove that state reachability in SwTPNs and all similar models is undecidable, even when bounded, which solves an open problem. Finally, we discuss overapproximation methods yielding finite abstractions of their behavior for a subclass of bounded SwTPNs, and propose a new one based on a quantization of the polyhedra representing temporal information. By adjusting a parameter, the exact behavior can be approximated as closely as desired. The methods have been implemented, experiments are reported.