( en | de | ru )

 

Disambiguation of "Lime, Didier"

Author of the publication

copydeleteadd this publication to your clipboard
Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets.

, , and . Petri Nets, volume 11522 of Lecture Notes in Computer Science, page 406-425. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Abdelhakim Limem

Leo Didier

Didier Béton

Didier Sangiorgio

Didier Fau

 

Other publications of authors with the same name

An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs., , and . LATA, volume 12638 of Lecture Notes in Computer Science, page 279-290. Springer, (2021)A Turn-Based Approach for Qualitative Time Concurrent Games., , and . Petri Nets, volume 12734 of Lecture Notes in Computer Science, page 76-92. Springer, (2021)Timed Non-interference Under Partial Observability and Bounded Memory., , and . FORMATS, volume 14138 of Lecture Notes in Computer Science, page 122-137. Springer, (2023)Reachability and liveness in parametric timed automata., , and . CoRR, (2020)Interrupt Timed Automata with Auxiliary Clocks and Parameters., , , and . Fundam. Informaticae, 143 (3-4): 235-259 (2016)Comparison of Different Semantics for Time Petri Nets., , , , and . ATVA, volume 3707 of Lecture Notes in Computer Science, page 293-307. Springer, (2005)Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph., , and . FORMATS, volume 5215 of Lecture Notes in Computer Science, page 280-294. Springer, (2008)Comparison of the Expressiveness of Timed Automata and Time Petri Nets., , , , and . FORMATS, volume 3829 of Lecture Notes in Computer Science, page 211-225. Springer, (2005)Romeo: A Tool for Analyzing Time Petri Nets., , , and . CAV, volume 3576 of Lecture Notes in Computer Science, page 418-423. Springer, (2005)Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata., , and . CoRR, (2023)