default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Laroussinie
- > Home > Persons > François Laroussinie
Publications
- 2006
[j9]Stéphane Demri, François Laroussinie, Philippe Schnoebelen:
A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci. 72(4): 547-575 (2006)- [j8]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Efficient timed model checking for discrete-time systems. Theor. Comput. Sci. 353(1-3): 249-271 (2006) - 2004
- [c16]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Model Checking Timed Automata with One or Two Clocks. CONCUR 2004: 387-401 - 2003
- [j6]François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297(1-3): 297-315 (2003) - 2002
- [c15]François Laroussinie, Nicolas Markey
, Philippe Schnoebelen:
On Model Checking Durational Kripke Structures. FoSSaCS 2002: 264-279 - [c14]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Temporal Logic with Forgettable Past. LICS 2002: 383-392 - [c13]Stéphane Demri, François Laroussinie, Philippe Schnoebelen:
A Parametric Analysis of the State Explosion Problem in Model Checking. STACS 2002: 620-631 - 2001
- [b1]Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, Pierre McKenzie:
Systems and Software Verification, Model-Checking Techniques and Tools. Springer 2001, ISBN 978-3-642-07478-3, pp. I-XII, 1-190 - [c12]François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Model Checking CTL+ and FCTL is Hard. FoSSaCS 2001: 318-331 - 2000
- [j4]François Laroussinie, Philippe Schnoebelen:
Specification in CTL+Past for Verification in CTL. Inf. Comput. 156(1-2): 236-263 (2000) - [c10]François Laroussinie, Philippe Schnoebelen:
The State Explosion Problem from Trace to Bisimulation Equivalence. FoSSaCS 2000: 192-207 - [c9]François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN 2000: 437-446 - 1997
- [c5]François Laroussinie, Philippe Schnoebelen:
Specification in CTL+Past, verification in CTL. EXPRESS 1997: 161-184 - 1995
- [j2]François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen:
Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. 140(1): 53-71 (1995) - [j1]François Laroussinie, Philippe Schnoebelen:
A Hierarchy of Temporal Logics with Past. Theor. Comput. Sci. 148(2): 303-324 (1995) - 1994
- [c2]François Laroussinie, Philippe Schnoebelen:
A Hierarchy of Temporal Logics with Past (Extended Abstract). STACS 1994: 47-58 - 1993
- [c1]François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen:
Translation Results for Modal Logics of Reactive Systems. AMAST 1993: 297-306
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
