The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

François Laroussinie: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen
    Translation Results for Modal Logics of Reactive Systems. [Citation Graph (0, 0)][DBLP]
    AMAST, 1993, pp:297-306 [Conf]
  2. Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
    Timed Temporal Logics for Abstracting Transient States. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:337-351 [Conf]
  3. Franck Cassez, François Laroussinie
    Model-Checking for Hybrid Systems by Quotienting and Constraints Solving. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:373-388 [Conf]
  4. Patricia Bouyer, Franck Cassez, François Laroussinie
    Modal Logics for Timed Control. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:81-94 [Conf]
  5. François Laroussinie, Kim Guldstrand Larsen
    Compositional Model Checking of Real Time Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:27-41 [Conf]
  6. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Model Checking Timed Automata with One or Two Clocks. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:387-401 [Conf]
  7. Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie
    A New Modality for Almost Everywhere Properties in Timed Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:110-124 [Conf]
  8. Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier
    Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2005, pp:112-126 [Conf]
  9. François Laroussinie, Nicolas Markey, Ghassan Oreiby
    Model-Checking Timed. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2006, pp:245-259 [Conf]
  10. François Laroussinie, Kim Guldstrand Larsen
    CMC: A Tool for Compositional Model-Checking of Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    FORTE, 1998, pp:439-456 [Conf]
  11. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Model Checking CTL+ and FCTL is Hard. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:318-331 [Conf]
  12. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    On Model Checking Durational Kripke Structures. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:264-279 [Conf]
  13. François Laroussinie, Ph. Schnoebelen
    The State Explosion Problem from Trace to Bisimulation Equivalence. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2000, pp:192-207 [Conf]
  14. François Laroussinie, Jeremy Sproston
    Model Checking Durational Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:140-154 [Conf]
  15. François Laroussinie, Ph. Schnoebelen, Mathieu Turuani
    On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:437-446 [Conf]
  16. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Temporal Logic with Forgettable Past. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:383-392 [Conf]
  17. Luca Aceto, François Laroussinie
    Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:125-136 [Conf]
  18. François Laroussinie, Kim Guldstrand Larsen, Carsten Weise
    From Timed Automata to Logic - and Back. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:529-539 [Conf]
  19. Stéphane Demri, François Laroussinie, Ph. Schnoebelen
    A Parametric Analysis of the State Explosion Problem in Model Checking. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:620-631 [Conf]
  20. François Laroussinie, Ph. Schnoebelen
    A Hierarchy of Temporal Logics with Past (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:47-58 [Conf]
  21. Kåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, Wang Yi
    A Compositional Proof of a Real-Time Mutual Exclusion Protocol. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:565-579 [Conf]
  22. François Laroussinie, Ph. Schnoebelen
    Specification in CTL+Past, verification in CTL. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
  23. François Laroussinie, Ph. Schnoebelen
    Specification in CTL+Past for Verification in CTL. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:156, n:1-2, pp:236-263 [Journal]
  24. François Laroussinie
    About the Expressive Power of CTL Combinators. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:6, pp:343-345 [Journal]
  25. François Laroussinie, Jeremy Sproston
    State explosion in almost-sure probabilistic reachability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:6, pp:236-241 [Journal]
  26. Stéphane Demri, François Laroussinie, Ph. Schnoebelen
    A parametric analysis of the state-explosion problem in model checking. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:547-575 [Journal]
  27. Luca Aceto, François Laroussinie
    Is your model checker on time? On the complexity of model checking for timed modal logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2002, v:52, n:, pp:7-51 [Journal]
  28. François Laroussinie, Nicolas Markey, Ph. Schnoebelen
    Efficient timed model checking for discrete-time systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:353, n:1-3, pp:249-271 [Journal]
  29. François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen
    Translations Between Modal Logics of Reactive Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:140, n:1, pp:53-71 [Journal]
  30. François Laroussinie, Ph. Schnoebelen
    A Hierarchy of Temporal Logics with Past. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:2, pp:303-324 [Journal]
  31. François Laroussinie, Ph. Schnoebelen, Mathieu Turuani
    On the expressivity and complexity of quantitative branching-time temporal logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:297-315 [Journal]
  32. Paul Caspi, Alberto L. Sangiovanni-Vincentelli, Luís Almeida, Albert Benveniste, Bruno Bouyssounouse, Giorgio C. Buttazzo, Ivica Crnkovic, Werner Damm, Jakob Engblom, Gerhard Fohler, Marisol García-Valls, Hermann Kopetz, Yassine Lakhnech, François Laroussinie, Luciano Lavagno, Giuseppe Lipari, Florence Maraninchi, Philipp Peti, Juan Antonio de la Puente, Norman Scaife, Joseph Sifakis, Robert de Simone, Martin Törngren, Paulo Veríssimo, Andy J. Wellings, Reinhard Wilhelm, Tim A. C. Willemse, Wang Yi
    Guidelines for a graduate curriculum on embedded software and systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Embedded Comput. Syst., 2005, v:4, n:3, pp:587-611 [Journal]
  33. Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby
    Timed Concurrent Game Structures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:445-459 [Conf]
  34. François Laroussinie, Nicolas Markey, Ghassan Oreiby
    On the Expressiveness and Complexity of ATL. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:243-257 [Conf]
  35. Marcin Jurdzinski, François Laroussinie, Jeremy Sproston
    Model Checking Probabilistic Timed Automata with One or Two Clocks. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:170-184 [Conf]

  36. Counting CTL. [Citation Graph (, )][DBLP]


  37. ATL with Strategy Contexts and Bounded Memory. [Citation Graph (, )][DBLP]


  38. On the Expressiveness and Complexity of ATL [Citation Graph (, )][DBLP]


  39. Model Checking Probabilistic Timed Automata with One or Two Clocks [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002