Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Analyzing paths in time petri nets
Fundamenta Informaticae - Special issue on Petri nets
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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
State space computation and analysis of Time Petri Nets
Theory and Practice of Logic Programming
On-the-fly TCTL model checking for Time Petri Nets using state class graphs
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches
Discrete Event Dynamic Systems
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Petri Nets with Time Windows: A Comparison to Classical Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
| Hi-index | 0.01 |
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Contrary to TPNs, SwPNs encompass the notion of actions that can be reset, stopped and started. Models can be defined either with discrete-time or dense-time semantics. Unlike dense-time, discrete-time leads to combinatorial explosion (state space is computed by an exhaustive enumeration of states). We can however take advantage from discrete-time, especially when it comes to SwPNs: state and marking reachability problems, undecidable even for bounded nets, become decidable once discrete-time is considered. Thus, to mitigate the issue of combinatorial explosion, we now aim to extend the well-known symbolic handling of time (using convex polyhedra) to the discrete-time setting. This is basically done by computing the state space of discrete-time nets as the discretization of the state space of the corresponding dense-time model. First, we prove that this technique is correct for TPNs but not for SwPNs in general: in fact, for the latter, it may add behaviors that do not really belong to the evolution of the discrete-time net. To overcome this problem, we propose a splitting of the general polyhedron that encompasses the temporal information of the net into an union of simpler polyhedra which are safe with respect to the symbolic successor computation. We then give an algorithm that computes symbolically the state space of discrete-time SwPNs and finally exhibit a way to perform TCTL model-checking on this model.