Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
DECIDABILITY QUESTIONS FOR PETRI NETS
DECIDABILITY QUESTIONS FOR PETRI NETS
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
When are Timed Automata weakly timed bisimilar to Time Petri Nets?
Theoretical Computer Science
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Formal verification of real-time systems with preemptive scheduling
Real-Time Systems
Comparison of the expressiveness of arc, place and transition time Petri nets
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Comparison of different semantics for time petri nets
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Comparison of the expressiveness of timed automata and time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Bridging the gap between timed automata and bounded time petri nets
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Hi-index | 0.00 |
With this contribution, we aim to draw a comprehensive classification of Petri nets with stopwatches w.r.t. expressiveness and decidability issues. This topic is too ambitious to be summarized in a single paper. That is why we present our results in two different parts. The scope of this first paper is to address the general results that apply for both dense-time and discrete-time semantics. We study the class of bounded Petri nets with stopwatches and reset arcs (rSwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Stopwatches can be reset, stopped and started. We give the formal dense-time and discrete-time semantics of these models in terms of Transition Systems. We study the expressiveness of rSwPNs and its subclasses w.r.t. (weak) bisimilarity (behavioral semantics). The main results are following: 1) bounded rSw- PNs and 1-safe rSwPNs are equally expressive; 2) For all models, reset arcs add expressiveness. 3) The resulting partial classification of models is given by a set of relations explained in Fig. 7: in the forthcoming paper, we will complete these results by covering expressiveness and decidability issues when discrete-time nets are considered. For the sake of simplicity, our results are explained on a model such that the stopwatches behaviors are expressed using inhibitor arcs. Our conclusions can however be easily extended to the general class of Stopwatch Petri nets.