Skip to Main content Skip to Navigation
Reports

Uniform Strategies

Bastien Maubert 1, * Sophie Pinchinat 1
* Corresponding author
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We consider turn-based game arenas for which we investigate uniformity properties of strategies. These properties involve bundles of plays, that arise from some semantical motive. Typically, we can represent constraints on allowed strategies, such as being observation-based. We propose a formal language to specify uniformity properties and demonstrate its relevance by rephrasing various known problems from the literature. Note that the ability to correlate different plays cannot be achieved by any branching-time logic if not equipped with an additional modality, so-called R in this contribution. We also study an automated procedure to synthesize strategies subject to a uniformity property, which strictly extends existing results based on, say standard temporal logics. We exhibit a generic solution for the synthesis problem provided the bundles of plays rely on any binary relation definable by a finite state transducer. This solution yields a non-elementary procedure.
Complete list of metadata

https://hal.inria.fr/hal-00760370
Contributor : Bastien Maubert <>
Submitted on : Monday, December 3, 2012 - 6:02:06 PM
Last modification on : Tuesday, June 15, 2021 - 4:26:15 PM
Long-term archiving on: : Monday, March 4, 2013 - 3:51:24 AM

Files

RR-8144.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00760370, version 1
  • ARXIV : 1212.0526

Citation

Bastien Maubert, Sophie Pinchinat. Uniform Strategies. [Research Report] RR-8144, INRIA. 2012. ⟨hal-00760370⟩

Share

Metrics

Record views

364

Files downloads

263