( en | de | ru )

 

Disambiguation of "Gastin, Paul"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Algorithms for Handling Diagonal Constraints in Timed Automata.

, , and . CAV (1), volume 11561 of Lecture Notes in Computer Science, page 41-59. 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.

Surajit Paul

Christina Paulus

Christian Pauli

Katarina Paulsson

Daniela Paul

 

Other publications of authors with the same name

Fast Algorithms for Handling Diagonal Constraints in Timed Automata., , and . CAV (1), volume 11561 of Lecture Notes in Computer Science, page 41-59. Springer, (2019)Editorial., and . Journal of Automata, Languages and Combinatorics, 7 (2): 165 (2002)Avoiding State Explosion for Distributed Systems with Timestamps., , and . FME, volume 2021 of Lecture Notes in Computer Science, page 119-134. Springer, (2001)Recognizable Complex Trace Languages., , and . MFCS, volume 520 of Lecture Notes in Computer Science, page 131-140. Springer, (1991)Weighted Automata and Weighted Logics., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 513-525. Springer, (2005)On Recognizable and Rational Formal Power Series in Partially Commuting Variables., and . ICALP, volume 1256 of Lecture Notes in Computer Science, page 682-692. Springer, (1997)Asynchronous Cellular Automata for Pomsets Without Auto-concurrency., and . CONCUR, volume 1119 of Lecture Notes in Computer Science, page 627-638. Springer, (1996)Intersection of Regular Signal-Event (Timed) Languages., , and . FORMATS, volume 4202 of Lecture Notes in Computer Science, page 52-66. Springer, (2006)Analyzing Timed Systems Using Tree Automata., , and . Log. Methods Comput. Sci., (2018)Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets., and . LPAR, volume 2250 of Lecture Notes in Computer Science, page 55-69. Springer, (2001)