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
Deriving Petri Nets from Finite Transition Systems
IEEE Transactions on Computers
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED 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
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
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
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. In the first part of our work, we established new results regarding to both dense-time and discrete-time semantics. We now focus on the discrete-time specificities. We address 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 recall 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) Discrete-time bounded TPNs, discrete-time bounded rSwPNs and untimed Petri nets are equally expressive; 2) The resulting (final) classification of models is given by a set of relations explained in Fig. 7. While investigating expressiveness, we exhibit proofs that can be easily extended to the resolution of decidability issues. Among other results, we prove that, for bounded rSwPNs, the state and marking reachability problems - undecidable with dense-time semantics - are decidable when discrete-time is considered. Table 1 gives a synthesis of the main decidability results for these models. 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.