Search

Your search keyword '"Roux, Olivier H."' showing total 24 results
Start Over Author "Roux, Olivier H." Topic time petri nets

Refine your results

more »

more »

24 results on '"Roux, Olivier H."'

1. On Parametric DBMs and Their Applications to Time Petri Nets

Author

Leclercq, Loriane, Lime, Didier, Roux, Olivier H., Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hillston, Jane, editor, Soudjani, Sadegh, editor, and Waga, Masaki, editor

Published
2024
Full Text
View/download PDF

2. A State Class Based Controller Synthesis Approach for Time Petri Nets

Author

Leclercq, Loriane, Lime, Didier, Roux, Olivier H., Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Gomes, Luis, editor, and Lorenz, Robert, editor

Published
2023
Full Text
View/download PDF

3. Probabilistic Time Petri Nets

Author

Emzivat, Yrvann, Delahaye, Benoît, Lime, Didier, Roux, Olivier H., Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Weikum, Gerhard, Series Editor, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Kordon, Fabrice, editor, and Moldt, Daniel, editor

Published
2016
Full Text
View/download PDF

4. On Multi-enabledness in Time Petri Nets

Author

Boucheneb, Hanifa, Lime, Didier, Roux, Olivier H., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Colom, José-Manuel, editor, and Desel, Jörg, editor

Published
2013
Full Text
View/download PDF

5. Symbolic Unfolding of Parametric Stopwatch Petri Nets

Author

Traonouez, Louis-Marie, Grabiec, Bartosz, Jard, Claude, Lime, Didier, Roux, Olivier H., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bouajjani, Ahmed, editor, and Chin, Wei-Ngan, editor

Published
2010
Full Text
View/download PDF

6. Diagnosis Using Unfoldings of Parametric Time Petri Nets

Author

Grabiec, Bartosz, Traonouez, Louis-Marie, Jard, Claude, Lime, Didier, Roux, Olivier H., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chatterjee, Krishnendu, editor, and Henzinger, Thomas A., editor

Published
2010
Full Text
View/download PDF

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

Author

Lime, Didier, Roux, Olivier H., Seidner, Charlotte, Traonouez, Louis-Marie, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Kowalewski, Stefan, editor, and Philippou, Anna, editor

Published
2009
Full Text
View/download PDF

8. Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)

Author

Magnin, Morgan, Lime, Didier, Roux, Olivier (H. ), Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, van Hee, Kees M., editor, and Valk, Rüdiger, editor

Published
2008
Full Text
View/download PDF

9. Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph

Author

Traonouez, Louis-Marie, Lime, Didier, Roux, Olivier H., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cassez, Franck, editor, and Jard, Claude, editor

Published
2008
Full Text
View/download PDF

10. When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?

Author

Bérard, Beatrice, Cassez, Franck, Haddad, Serge, Lime, Didier, Roux, Olivier H., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sarukkai, Sundar, editor, and Sen, Sandeep, editor

Published
2005
Full Text
View/download PDF

11. Romeo: A Tool for Analyzing Time Petri Nets

Author

Gardey, Guillaume, Lime, Didier, Magnin, Morgan, Roux, Olivier (H. ), Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Etessami, Kousha, editor, and Rajamani, Sriram K., editor

Published
2005
Full Text
View/download PDF

12. Comparison of the Expressiveness of Timed Automata and Time Petri Nets

Author

Bérard, Beatrice, Cassez, Franck, Haddad, Serge, Lime, Didier, Roux, Olivier H., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Pettersson, Paul, editor, and Yi, Wang, editor

Published
2005
Full Text
View/download PDF

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

Author

Roux, Olivier H., Lime, Didier, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cortadella, Jordi, editor, and Reisig, Wolfgang, editor

Published
2004
Full Text
View/download PDF

19. Cost Problems for Parametric Time Petri Nets*.

Author

Lime, Didier, Roux, Olivier H., Seidner, Charlotte, Donatelli, Susanna, Haar, Stefan, and Lasota, Slawomir

Subjects
*PETRI nets, *VARIABLE costs, *SOFTWARE development tools, *TIME management, *COST, *LINEAR programming
Abstract

We investigate the problem of parameter synthesis for time Petri nets with a cost variable that evolves both continuously with time, and discretely when firing transitions. More precisely, parameters are rational symbolic constants used for time constraints on the firing of transitions and we want to synthesise all their values such that some marking is reachable, with a cost that is either minimal or simply less than a given bound. We first prove that the mere existence of values for the parameters such that the latter property holds is undecidable. We nonetheless provide symbolic semi-algorithms for the two synthesis problems and we prove them both sound and complete when they terminate. We also show how to modify them for the case when parameter values are integers. Finally, we prove that these modified versions terminate if parameters are bounded. While this is to be expected since there are now only a finite number of possible parameter values, our algorithms are symbolic and thus avoid an explicit enumeration of all those values. Furthermore, the results are symbolic constraints representing finite unions of convex polyhedra that are easily amenable to further analysis through linear programming. We finally report on the implementation of the approach in Romeo, a software tool for the analysis of time Petri nets. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

20. Cost Problems for Parametric Time Petri Nets*.

Author

Lime, Didier, Roux, Olivier H., Seidner, Charlotte, Donatelli, Susanna, Haar, Stefan, and Lasota, Slawomir

Subjects
PETRI nets, VARIABLE costs, SOFTWARE development tools, TIME management, COST, LINEAR programming
Abstract

We investigate the problem of parameter synthesis for time Petri nets with a cost variable that evolves both continuously with time, and discretely when firing transitions. More precisely, parameters are rational symbolic constants used for time constraints on the firing of transitions and we want to synthesise all their values such that some marking is reachable, with a cost that is either minimal or simply less than a given bound. We first prove that the mere existence of values for the parameters such that the latter property holds is undecidable. We nonetheless provide symbolic semi-algorithms for the two synthesis problems and we prove them both sound and complete when they terminate. We also show how to modify them for the case when parameter values are integers. Finally, we prove that these modified versions terminate if parameters are bounded. While this is to be expected since there are now only a finite number of possible parameter values, our algorithms are symbolic and thus avoid an explicit enumeration of all those values. Furthermore, the results are symbolic constraints representing finite unions of convex polyhedra that are easily amenable to further analysis through linear programming. We finally report on the implementation of the approach in Romeo, a software tool for the analysis of time Petri nets. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

21. Blending Timed Formal Models with Clock Transition Systems.

Author

Jard, Claude, Lime, Didier, and Roux, Olivier H.

Subjects
PETRI nets, MACHINE theory, MATHEMATICAL models, SEMANTICS, COMPUTATIONAL complexity, REAL-time computing
Abstract

Networks of Timed Automata (NTA) and Time Petri Nets (TPNs) are well-established formalisms used to model, analyze and control industrial real-time systems. The underlying theories are usually developed in different scientific communities and both formalisms have distinct strong points: for instance, conciseness for TPNs and a more flexible notion of urgency for NTA. The objective of the paper is to introduce a new model allowing the joint use of both TPNs and NTA for the modeling of timed systems. We call it Clock Transition System (CTS). This new model incorporates the advantages of the structure of Petri nets, while introducing explicitly the concept of clocks. Transitions in the network can be guarded by an expression on the clocks and reset a subset of them as in timed automata. The urgency is introduced by a separate description of invariants. We show that CTS allow to express TPNs (even when unbounded) and NTA. For those two classical models, we identify subclasses of CTSs equivalent by isomorphism of their operational semantics and provide (syntactic) translations. The classical state-space computation developed for NTA and then adapted to TPNs can easily be defined for general CTSs. Armed with these merits, the CTS model seems a good candidate to serve as an intermediate theoretical and practical model to factor out the upcoming developments in the TPNs and the NTA scientific communities. [ABSTRACT FROM AUTHOR]

Published
2014
Full Text
View/download PDF

22. Expressiveness of Petri Nets with Stopwatches. Discrete-time Part.

Author

Magnin, Morgan, Molinaro, Pierre, and Roux, Olivier (H.)

Subjects
PETRI nets, STOPWATCHES, DISCRETE-time systems, NETS (Mathematics), TIME series analysis, DECIDABILITY (Mathematical logic)
Abstract

With this contribution, we aim to draw a comprehensive classification of Petri nets with stopwatches w.r.t. expressiveness and decidability issues. This topic is too ambitious to be summarized in a single paper. That is why we present our results in two different parts. In the first part of our work, we established new results regarding to both dense-time and discrete-time semantics. We now focus on the discrete-time specificities. We address the class of bounded Petri nets with stopwatches and reset arcs (rSwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Stopwatches can be reset, stopped and started. We recall the formal dense-time and discrete-time semantics of these models in terms of Transition Systems. We study the expressiveness of rSwPNs and its subclasses w.r.t. (weak) bisimilarity (behavioral semantics). The main results are following: 1) Discrete-time bounded TPNs, discrete-time bounded rSwPNs and untimed Petri nets are equally expressive; 2) The resulting (final) classification of models is given by a set of relations explained in Fig. 7. While investigating expressiveness, we exhibit proofs that can be easily extended to the resolution of decidability issues. Among other results, we prove that, for bounded rSwPNs, the state and marking reachability problems - undecidable with dense-time semantics - are decidable when discrete-time is considered. Table 1 gives a synthesis of the main decidability results for these models. For the sake of simplicity, our results are explained on a model such that the stopwatches behaviors are expressed using inhibitor arcs. Our conclusions can however be easily extended to the general class of Stopwatch Petri nets. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

23. An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches.

Author

Magnin, Morgan, Lime, Didier, and Roux, Olivier (H.)

Subjects
SYSTEM analysis, COMPUTER systems, ELECTRONIC systems, COMPUTER programming
Abstract

Abstract: In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the state-space of the system, modeled as a time Petri net with stopwatches, exactly and efficiently, by the use of Difference Bounds Matrices (DBM) whenever possible and automatically switching to more time and memory consuming general (convex) polyhedra only when required. We propose a necessary and sufficient condition for the need of general polyhedra. We give experimental results comparing our implementation of the method to a full DBM over-approximation and to an exact computation with only general polyhedra. [Copyright &y& Elsevier]

Published
2006
Full Text
View/download PDF

24. Structural Translation from Time Petri Nets to Timed Automata.

Author

Cassez, Franck and Roux, Olivier-H.

Subjects
MACHINE theory, SEMANTICS, ROBOTS, GRAPH theory
Abstract

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 behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: 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 analysing timed automata (like Kronos, Uppaal or Cmc) to analyse TPNs. [Copyright &y& Elsevier]

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results