We show in this paper how to contract the TPN state space into a graph that captures all its
CTL* properties. This graph, called Atomic State Class Graph (ASCG), is finite if and only if …

This paper deals with the verification of CTL* properties of Time Petri Nets (TPN model). To
verify such properties, we need to contract the generally infinite state space of the TPN …

We consider here time Petri nets (TPN model). We first propose an abstraction to its
generally infinite state space which preserves linear properties of the TPN model …

We propose in this paper some efficient approaches, based on the state class graph
method, to construct abstractions for the Time Petri Net (TPN) model, suitable to verify its …

This paper aims at applying the CTL* 1 model checking method to the time Petri net (TPN)
model. We show here how to contract its generally infinite state space into a graph that …

We consider here time Petri nets (TPN model). We first propose an abstraction to its
generally infinite state space which preserves linear properties of the TPN model …

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 …

Interchangeable High-Level Time Petri Nets Page 1 Interchangeable High-Level Time Petri
Nets Christian Stehno Parallel Systems group Department for Computing Science Carl von …

The most important challenge in the region-based abstraction method as an approach to
compute the state space of time Petri Nets (TPNs) for model checking is that the method …

In this paper, we show how to efficiently model check a subset of TCTL properties for the
Time Petri Net model (TPN model), using the state class method. The verification proceeds …