( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Model Checking Timed Automata with One or Two Clocks.

, , и . CONCUR, том 3170 из Lecture Notes in Computer Science, стр. 387-401. Springer, (2004)

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.

Philippe Kersting

Philippe Bopp

Philippe Moisan

Philippe Zysset

Philippe Dreuw

 

Другие публикации лиц с тем же именем

On the index of Simon's congruence for piecewise testability., и . CoRR, (2013)Model Checking Timed Automata with One or Two Clocks., , и . CONCUR, том 3170 из Lecture Notes in Computer Science, стр. 387-401. Springer, (2004)Verifying Performance Equivalence for Timed Basic Parallel Processes., , и . FoSSaCS, том 1784 из Lecture Notes in Computer Science, стр. 35-47. Springer, (2000)Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets.. MFCS, том 6281 из Lecture Notes in Computer Science, стр. 616-628. Springer, (2010)The Height of Piecewise-Testable Languages with Applications in Logical Complexity., и . CSL, том 62 из LIPIcs, стр. 37:1-37:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the piecewise complexity of words and periodic words., , , и . CoRR, (2023)Fundamental Structures in Well-Structured Infinite Transition Systems., и . LATIN, том 1380 из Lecture Notes in Computer Science, стр. 102-118. Springer, (1998)Refined Compilation of Pattern-Matching for Functional Languages.. Sci. Comput. Program., 11 (2): 133-159 (1988)\tau-Bisimulations and Full Abstraction for Refinement of Actions., и . Inf. Process. Lett., 40 (4): 219-222 (1991)On the State Complexity of Closures and Interiors of Regular Languages with Subwords., и . DCFS, том 8614 из Lecture Notes in Computer Science, стр. 234-245. Springer, (2014)