In this paper, we propose a method for building the state class graph of a bounded time Petri
net (TPN) as a timed automaton (TA). We consider bounded TPN, whose underlying net is …

In this paper, we propose a method for building the state class graph of a bounded time Petri
net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We …

In this chapter we introduce a formalism, Time Petri Nets (TPNs), to model real-time systems.
We compare it with another well-known formalism, Timed Automata (TA), used for specifying …

We show that an important subclass of timed automata (Alur and Dill, 1994), called timed
state machines, is weakly time equivalent to safe non-zero time Petri nets (TPNs) in the …

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 …

Presently, the method to verify quantitative time properties on Time Petri Nets is the use of
observers. The state space is then computed to test the reachability of a given marking. The …

The theory of Petri Nets provides a general framework to specify the behaviors of real-time
reactive systems and Time Petri Nets were introduced to take also temporal specifications …

Abstract We consider Time Petri Nets (TPN) for which a firing time interval is associated with
each transition. State space abstractions for TPN preserving various classes of properties …

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 …

Abstract Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the
modeling and analysis of timed systems. A recently-developed approach for the analysis of …