Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
5 results

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 whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its&nbsp;[&hellip;]
Published on December 25, 2014

Pure Nash Equilibria in Concurrent Deterministic Games

Patricia Bouyer ; Romain Brenguier ; Nicolas Markey ; Michael Ummels.
We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a two-player turn-based game which turns Nash equilibria into&nbsp;[&hellip;]
Published on June 19, 2015

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 of agents in order to enforce a given property. In this paper, we first precisely characterize the complexity of ATL&nbsp;[&hellip;]
Published on May 15, 2008

Model Checking One-clock Priced Timed Automata

Patricia Bouyer ; Kim G. Larsen ; Nicolas Markey.
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities.&nbsp;[&hellip;]
Published on June 20, 2008

Language Preservation Problems in Parametric Timed Automata

Étienne André ; Didier Lime ; Nicolas Markey.
Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter valuation, does there exist another parameter&nbsp;[&hellip;]
Published on January 22, 2020

  • < Previous
  • 1
  • Next >