Using zone graph method for computing the state space of a time Petri net
G Gardey, OH Roux, OF Roux - Formal Modeling and Analysis of Timed …, 2004 - Springer
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 …
observers. The state space is then computed to test the reachability of a given marking. The …
State space computation and analysis of time Petri nets
G Gardey, OH Roux, OF Roux - Theory and Practice of Logic …, 2006 - cambridge.org
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 …
reactive systems and Time Petri Nets were introduced to take also temporal specifications …
From time Petri nets to timed automata: An untimed approach
D D'Aprile, S Donatelli, A Sangnier… - … 2007, Held as Part of the …, 2007 - Springer
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 …
modeling and analysis of timed systems. A recently-developed approach for the analysis of …
State class timed automaton of a time Petri net
D Lime - Petri Nets and Performance Models, IEEE International …, 2003 - computer.org
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 …
net (TPN) as a timed automaton (TA). We consider bounded TPN, whose underlying net is …
Model checking of time Petri nets using the state class timed automaton
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 …
net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We …
An enumerative approach for analyzing time Petri nets
B Berthomieu, M Menasche - IFIP 9th World Computer Congress, 1983 - hal.laas.fr
This paper is concerned with specifying and proving correct systems in which time appears
as a parameter. We model such systems via Merlin's Time Petri Nets. An enumerative …
as a parameter. We model such systems via Merlin's Time Petri Nets. An enumerative …
Romeo: A tool for analyzing time Petri nets
In this paper, we present the features of Romeo, a Time Petri Net (TPN) analyzer. The tool
Romeo allows state space computation of TPN and on-the-fly model-checking of reachability …
Romeo allows state space computation of TPN and on-the-fly model-checking of reachability …
TCTL model checking of time Petri nets
H Boucheneb, G Gardey… - Journal of Logic and …, 2009 - ieeexplore.ieee.org
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 …
each transition. State space abstractions for TPN preserving various classes of properties …
Equivalence of timed state machines and safe TPN
S Haar, L Kaiser, F Simonot-Lion… - … Workshop on Discrete …, 2002 - ieeexplore.ieee.org
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 …
state machines, is weakly time equivalent to safe non-zero time Petri nets (TPNs) in the …
Time-based expressivity of time Petri nets for system specification
A Cerone, A Maggiolo-Schettini - Theoretical Computer Science, 1999 - Elsevier
Various models of time Petri Nets have been successfully used to adequately specify time-
critical systems. For such systems correctness depends not only on the actions that are …
critical systems. For such systems correctness depends not only on the actions that are …