D
Didier Lime
Researcher at École centrale de Nantes
Publications - 110
Citations - 2523
Didier Lime is an academic researcher from École centrale de Nantes. The author has contributed to research in topics: Petri net & Reachability. The author has an hindex of 23, co-authored 108 publications receiving 2308 citations. Previous affiliations of Didier Lime include Aalborg University & Centre national de la recherche scientifique.
Papers
More filters
Book ChapterDOI
Efficient on-the-fly algorithms for the analysis of timed games
TL;DR: This paper proposes the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties and various optimizations of the basic symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies.
Book ChapterDOI
UPPAAL-Tiga: time for playing games!
Gerd Behrmann,Agnès Cougnard,Alexandre David,Emmanuel Fleury,Kim Guldstrand Larsen,Didier Lime +5 more
TL;DR: The first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties has now matured to a fully integrated tool with dramatic improvements both in terms of performance and the availability of the extended input language of UPPAAL-4.0.
Book ChapterDOI
Romeo: A Tool for Analyzing Time Petri Nets
TL;DR: The tool Romeo allows state space computation of TPN and on-the-fly model-checking of reachability properties and 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.
Book ChapterDOI
Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches
TL;DR: Romeo is the first tool that performs TCTL model-checking on timed parametric models and its audience has increased leading to several industrial contracts.
Book ChapterDOI
Comparison of the expressiveness of timed automata and time petri nets
TL;DR: In this paper, the authors consider the model of Time Petri Nets (TPN) where time is associated with transitions and compare the expressiveness of the two models w.r.t. timed language acceptance and weak bisimilarity.