output
19962026
most citedSelective review of offline change point detection methods

1.4k citations

Showing 2015 · cs.LOShow all

11 papers · 2 filters

cs.LO2015

Average-energy games (full version)

Patricia Bouyer, Nicolas Markey, Mickael Randour +2

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment.…

cs.LO2015★ 5 cited

Decidability in the logic of subsequences and supersequences

Prateek Karandikar, Philippe Schnoebelen

We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the Σ_2 theory is undecidable, answering a question left open…

cs.LO2015★ 42 cited

Relational reasoning via probabilistic coupling

Gilles Barthe, Thomas Espitau, Benjamin Grégoire +3

Probabilistic coupling is a powerful tool for analyzing pairs of probabilistic processes. Roughly, coupling two processes requires finding an appropriate witness process that model…

cs.LO2015★ 35 cited

Approaching the Coverability Problem Continuously

Michael Blondin, Alain Finkel, Christoph Haase +1

The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challe…

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.LO2015★ 10 cited

Average-energy games

Patricia Bouyer, Nicolas Markey, Mickael Randour +2

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment.…