#### Filter Results:

- Full text PDF available (65)

#### Publication Year

1988

2017

- This year (5)
- Last 5 years (41)
- Last 10 years (65)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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… (More)

- Franck Cassez, Olivier H. Roux
- Electr. Notes Theor. Comput. Sci.
- 2005

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 two-fold: i)… (More)

- Guillaume Gardey, Olivier H. Roux, Olivier F. Roux
- FORMATS
- 2003

Last time we reported on Romeo, analyses with this tool were mostly based on translations to other tools. This new version provides an integrated TCTL model-checker and has gained in expressivity with the addition of parameters. Although there exists other tools to compute the state-space of stopwatch models, Romeo is the first one that performs TCTL… (More)

In this paper we study the model of Time Petri Nets (TPNs) where a time interval is associated with the firing of a transition, but we extend it by considering general intervals rather than closed ones. A key feature of timed models is the memory policy, i.e. which timing informations are kept when a transition is fired. The original model selects an… (More)

- Hanifa Boucheneb, Guillaume Gardey, Olivier H. Roux
- J. Log. Comput.
- 2009

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 (LTL, CTL, CTL) can be computed, in terms of so called state classes. Some methods were proposed to check quantitative timed properties but are not suitable for effective… (More)

- Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux
- FORMATS
- 2005

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 A s.t. there is no TPN (even unbounded)… (More)

- Didier Lime, Olivier H. Roux
- Discrete Event Dynamic Systems
- 2006

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 consider bounded TPN, whose underlying net is not necessarily bounded. We prove that our translation preserves the behavioural semantics of the TPN (the initial TPN and the… (More)

- Dominique Bertrand, Anne-Marie Déplanche, Sébastien Faucou, Olivier H. Roux
- 13th IEEE International Conference on Engineering…
- 2008

This paper describes a contribution to the verification of AADL models. It focuses on the part of the language dealing with operating modes. An analysis of the AADL mode change protocol is provided. Then, a translation process is exposed, that takes as an input an AADL model and produces as an output a time Petri net. Lastly, it is explained how the… (More)

- Didier Lime, Olivier H. Roux
- PNPM
- 2003