Olivier Henri Roux

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 properties. It performs translations from TPNs to Timed Automata (TAs) that preserve the behavioural semantics (timed bisimilarity) of the TPNs. Besides, our tool also deals with an extension of Time Petri Nets (Scheduling-TPNs) for which the valuations of transitions may be stopped and resumed, thus allowing the modeling preemption.

Structural translation from time petri nets to timed automata

Abstract In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioral semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is twofold: (i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; (ii) allowing strict time constraints on transitions for TPNs preserves the results described in (i). The practical applications of the translation are: (i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; (ii) one can use existing tools for analyzing timed automata (like K ronos , U ppaal or C mc ) to analyze TPNs. In this paper we describe the new feature of the tool R omeo that implements our translation of TPNs in the U ppaal input format. We also report on experiments carried out on various examples and compare the result of our method to state-of-the-art tool for analyzing TPNs.

Comparison of the expressiveness of timed automata and time petri nets

In this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur & Dill, and compare the expressiveness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity. We first prove that there exists a TA

Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches

\mathcal{A}

How does heat shock affect the life history traits of adults and progeny of the aphid parasitoid Aphidius avenae (Hymenoptera: Aphidiidae)?

s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to

Comparison of different semantics for time petri nets

\mathcal{A}

Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches

. We then propose a structural translation from TA to (1-safe) TPNs preserving timed language acceptance. Further on, we prove that the previous (slightly extended) translation also preserves weak timed bisimilarity for a syntactical subclass

Model Checking of Time Petri Nets Using the State Class Timed Automaton

\mathcal{T}_{syn}(\leq,\geq)

Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation

of TA. For the theory of TPNs, the consequences are: 1) TA, bounded TPNs and 1-safe TPNs are equally expressive w.r.t. timed language acceptance; 2) TA are strictly more expressive than bounded TPNs w.r.t. timed bisimilarity; 3) The subclass

State class timed automaton of a time Petri net

\mathcal{T}_{syn}(\leq,\geq)