François Laroussinie

According to our database, François Laroussinie authored at least 52 papers between 1993 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2025

Arbitrary-Arity Tree Automata for QCTL.

François Laroussinie, Nicolas Markey

Proceedings of the 36th International Conference on Concurrency Theory, 2025

2024

Arbitrary-arity Tree Automata and QCTL.

François Laroussinie, Nicolas Markey

CoRR, 2024

QLTL Model-Checking.

François Laroussinie, Loriane Leclercq, Arnaud Sangnier

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2021

QCTL model-checking with QBF solvers.

Akash Hossain, François Laroussinie

Inf. Comput., 2021

2019

From Quantified CTL to QBF.

Akash Hossain, François Laroussinie

Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

Towards Synthesis of Distributed Algorithms with SMT Solvers.

Carole Delporte-Gallet, Hugues Fauconnier, Yan Jurski, François Laroussinie, Arnaud Sangnier

Proceedings of the Networked Systems - 7th International Conference, 2019

2017

Timed Temporal Logics.

Patricia Bouyer, François Laroussinie, Nicolas Markey, Joël Ouaknine, James Worrell

Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016

On the Expressiveness of QCTL.

Amélie David, François Laroussinie, Nicolas Markey

Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015

Augmenting ATL with strategy contexts.

François Laroussinie, Nicolas Markey

Inf. Comput., 2015

ATLsc with partial observation.

François Laroussinie, Nicolas Markey, Arnaud Sangnier

Proceedings of the Proceedings Sixth International Symposium on Games, 2015

2014

Quantified CTL: Expressiveness and Complexity.

François Laroussinie, Nicolas Markey

Log. Methods Comput. Sci., 2014

2013

Satisfiability of ATL with strategy contexts.

François Laroussinie, Nicolas Markey

Proceedings of the Proceedings Fourth International Symposium on Games, 2013

2012

Quantified CTL: Expressiveness and Model Checking - (Extended Abstract).

Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

Timed Modal Logics for Real-Time Systems - Specification, Verification and Control.

Patricia Bouyer, Franck Cassez, François Laroussinie

J. Log. Lang. Inf., 2011

2010

Temporal Logics for Games.

François Laroussinie

Bull. EATCS, 2010

Christel Baier and Joost-Pieter Katoen<i>Principles of Model Checking</i>. MIT Press (May 2008).ISBN: 978-0-262-02649-9, 975 pp. Hardcover.

François Laroussinie

Comput. J., 2010

Counting LTL.

François Laroussinie, Antoine Meyer, Eudes Petonnet

Proceedings of the TIME 2010, 2010

ATL with Strategy Contexts: Expressiveness and Model Checking.

Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Counting CTL.

François Laroussinie, Antoine Meyer, Eudes Petonnet

Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009

ATL with Strategy Contexts and Bounded Memory.

Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2007

State explosion in almost-sure probabilistic reachability.

François Laroussinie, Jeremy Sproston

Inf. Process. Lett., 2007

Model Checking Probabilistic Timed Automata with One or Two Clocks.

Marcin Jurdzinski, François Laroussinie, Jeremy Sproston

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

On the Expressiveness and Complexity of ATL.

François Laroussinie, Nicolas Markey, Ghassan Oreiby

Proceedings of the Foundations of Software Science and Computational Structures, 2007

Timed Concurrent Game Structures.

Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006

Efficient timed model checking for discrete-time systems.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Theor. Comput. Sci., 2006

Model-Checking Timed.

François Laroussinie, Nicolas Markey, Ghassan Oreiby

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

Timed Temporal Logics for Abstracting Transient States.

Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie

Proceedings of the Automated Technology for Verification and Analysis, 2006

2005

Guidelines for a graduate curriculum on embedded software and systems.

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

ACM Trans. Embed. Comput. Syst., 2005

Model Checking Durational Probabilistic Systems.

François Laroussinie, Jeremy Sproston

Proceedings of the Foundations of Software Science and Computational Structures, 2005

Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems.

Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

A New Modality for Almost Everywhere Properties in Timed Automata.

Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Modal Logics for Timed Control.

Patricia Bouyer, Franck Cassez, François Laroussinie

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

Model Checking Timed Automata with One or Two Clocks.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2002

A Parametric Analysis of the State Explosion Problem in Model Checking.

Stéphane Demri, François Laroussinie, Philippe Schnoebelen

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Temporal Logic with Forgettable Past.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

On Model Checking Durational Kripke Structures.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

Model Checking CTL⁺ and FCTL is Hard.

François Laroussinie, Nicolas Markey, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computation Structures, 2001

Systems and Software Verification, Model-Checking Techniques and Tools.

Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie

Springer, ISBN: 9783540415237, 2001

2000

On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.

François Laroussinie, Philippe Schnoebelen, Mathieu Turuani

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

The State Explosion Problem from Trace to Bisimulation Equivalence.

François Laroussinie, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computation Structures, 2000

Model-Checking for Hybrid Systems by Quotienting and Constraints Solving.

Franck Cassez, François Laroussinie

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999

Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics.

Luca Aceto, François Laroussinie

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998

CMC: A Tool for Compositional Model-Checking of Real-Time Systems.

François Laroussinie, Kim Guldstrand Larsen

Proceedings of the Formal Description Techniques and Protocol Specification, 1998

1997

Specification in CTL+Past, verification in CTL.

François Laroussinie, Philippe Schnoebelen

Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

A Compositional Proof of a Real-Time Mutual Exclusion Protocol.

Kåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, Wang Yi

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995

A Hierarchy of Temporal Logics with Past.

François Laroussinie, Philippe Schnoebelen

Theor. Comput. Sci., 1995

Translations Between Modal Logics of Reactive Systems.

François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen

Theor. Comput. Sci., 1995

About the Expressive Power of CTL Combinators.

François Laroussinie

Inf. Process. Lett., 1995

From Timed Automata to Logic - and Back.

François Laroussinie, Kim Guldstrand Larsen, Carsten Weise

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Compositional Model Checking of Real Time Systems.

François Laroussinie, Kim Guldstrand Larsen

Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994

A Hierarchy of Temporal Logics with Past (Extended Abstract).

François Laroussinie, Philippe Schnoebelen

Proceedings of the STACS 94, 1994

1993

Translation Results for Modal Logics of Reactive Systems.

François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen

Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993