( en | de | ru )

 

Disambiguation of "Schnoebelen, Philippe"

Author of the publication

copydeleteadd this publication to your clipboard
On the expressivity and complexity of quantitative branching-time temporal logics.

, , and . Theor. Comput. Sci., 297 (1-3): 297-315 (2003)

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.

Philippe Dreuw

Philippe Moisan

Philippe Zysset

Philippe Kersting

Philippe Bopp

 

Other publications of authors with the same name

The Height of Piecewise-Testable Languages with Applications in Logical Complexity., and . CSL, volume 62 of LIPIcs, page 37:1-37:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems., and . Nord. J. Comput., 9 (1): 118-144 (2002)On the index of Simon's congruence for piecewise testability., and . CoRR, (2013)On flat lossy channel machines.. CoRR, (2020)Fundamental Structures in Well-Structured Infinite Transition Systems., and . LATIN, volume 1380 of Lecture Notes in Computer Science, page 102-118. Springer, (1998)Model Checking Timed Automata with One or Two Clocks., , and . CONCUR, volume 3170 of Lecture Notes in Computer Science, page 387-401. Springer, (2004)Verifying Performance Equivalence for Timed Basic Parallel Processes., , and . FoSSaCS, volume 1784 of Lecture Notes in Computer Science, page 35-47. Springer, (2000)Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets.. MFCS, volume 6281 of Lecture Notes in Computer Science, page 616-628. Springer, (2010)On the piecewise complexity of words and periodic words., , , and . CoRR, (2023)On Reachability for Unidirectional Channel Systems Extended with Regular Tests., , and . Log. Methods Comput. Sci., (2015)