( en | de | ru )

 

Disambiguation of "Botlan, Didier Le"

Author of the publication

copydeleteadd this publication to your clipboard
A Language for Quality of Service Requirements Specification in Web Services Orchestrations.

, , , and . ICSOC Workshops, volume 4652 of Lecture Notes in Computer Science, page 38-49. Springer, (2006)

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.

Leo Didier

Didier Béton

Didier Sangiorgio

Didier Fau

Didier Gava

 

Other publications of authors with the same name

Concurrent aspects., , , and . GPCE, page 79-88. ACM, (2006)A State Class Construction for Computing the Intersection of Time Petri Nets Languages., , , , and . FORMATS, volume 11750 of Lecture Notes in Computer Science, page 79-95. Springer, (2019)MLF: An extension of ML with first-class polymorphism and implicit instantiation. (MLF : Une extension de ML avec polymorphisme de second ordre et instanciation implicite).. École Polytechnique, Palaiseau, France, (2004)Petri Net Reductions for Counting Markings., , and . SPIN, volume 10869 of Lecture Notes in Computer Science, page 65-84. Springer, (2018)Leveraging polyhedral reductions for solving Petri net reachability problems., , and . CoRR, (2023)Accelerating the Computation of Dead and Concurrent Places Using Reductions., , and . SPIN, volume 12864 of Lecture Notes in Computer Science, page 45-62. Springer, (2021)Presentation of the 9th Edition of the Model Checking Contest., , , , , , , , , and 9 other author(s). TACAS (3), volume 11429 of Lecture Notes in Computer Science, page 50-68. Springer, (2019)MLF: raising ML to the power of system F., and . ICFP, page 27-38. ACM, (2003)From FMTV to WATERS: Lessons Learned from the First Verification Challenge at ECRTS (Invited Paper)., , , , , , , , , and 5 other author(s). ECRTS, volume 262 of LIPIcs, page 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability., , and . VMCAI (1), volume 14499 of Lecture Notes in Computer Science, page 101-123. Springer, (2024)