activity
20082020
most citedQuantified CTL: Expressiveness and Complexity

40 citations · 104 across the 7 of their papers we have counts for

collaborators

8 papers

cs.LO2020★ 1 cited

QCTL model-checking with QBF solvers

A. Hossain, F. Laroussinie

Quantified CTL (QCTL) extends the temporal logic CTL with quantifications over atomic propositions. This extension is known to be very expressive: QCTL allows us to express complex…

cs.LO2019

From Quantified CTL to QBF

Akash Hossain, Francois Laroussinie

QCTL extends the temporal logic CTL with quantifications over atomic propositions. This extension is known to be very expressive: QCTL allows us to express complex properties over…

cs.LO2015★ 8 cited

ATLsc with partial observation

François Laroussinie, Nicolas Markey, Arnaud Sangnier

Alternating-time temporal logic with strategy contexts (ATLsc) is a powerful formalism for expressing properties of multi-agent systems: it extends CTL with strategy quantifiers, o…

cs.LO2014★ 40 cited

Quantified CTL: Expressiveness and Complexity

François Laroussinie, Nicolas Markey

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending…

cs.LO2013★ 11 cited

Satisfiability of ATL with strategy contexts

François Laroussinie, Nicolas Markey

Various extensions of the temporal logic ATL have recently been introduced to express rich properties of multi-agent systems. Among these, ATLsc extends ATL with strategy contexts,…

cs.LO2012★ 1 cited

Counting CTL

François Laroussinie, Antoine Meyer, Eudes Petonnet

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert…

cs.LO2008★ 28 cited

Model Checking Probabilistic Timed Automata with One or Two Clocks

Marcin Jurdzinski, Francois Laroussinie, Jeremy Sproston

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t…

cs.LO2008★ 15 cited

On the Expressiveness and Complexity of ATL

Francois Laroussinie, Nicolas Markey, Ghassan Oreiby

ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions o…