( en | de | ru )

 

Disambiguation of "Laroussinie, François"

Author of the publication

copydeleteadd this publication to your clipboard
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.

, , and . LATIN, volume 1776 of Lecture Notes in Computer Science, page 437-446. Springer, (2000)

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.

François Weirich

François Elvinger

François Franceschi

François Melis

François Guers

 

Other publications of authors with the same name

Satisfiability of ATL with strategy contexts., and . GandALF, volume 119 of EPTCS, page 208-223. (2013)On the Expressiveness and Complexity of ATL., , and . Logical Methods in Computer Science, (2008)Model Checking Probabilistic Timed Automata with One or Two Clocks., , and . Logical Methods in Computer Science, (2008)Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems., , and . FORMATS, volume 3829 of Lecture Notes in Computer Science, page 112-126. Springer, (2005)Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics., and . MFCS, volume 1672 of Lecture Notes in Computer Science, page 125-136. Springer, (1999)From Quantified CTL to QBF., and . TIME, volume 147 of LIPIcs, page 11:1-11:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Quantified CTL: Expressiveness and Model Checking - (Extended Abstract)., , and . CONCUR, volume 7454 of Lecture Notes in Computer Science, page 177-192. Springer, (2012)Model Checking Timed Automata with One or Two Clocks., , and . CONCUR, volume 3170 of Lecture Notes in Computer Science, page 387-401. Springer, (2004)On the expressivity and complexity of quantitative branching-time temporal logics., , and . Theor. Comput. Sci., 297 (1-3): 297-315 (2003)A Hierarchy of Temporal Logics with Past., and . Theor. Comput. Sci., 148 (2): 303-324 (1995)