A tableau for bundled strategies

John Mccabe-Dansted, Mark Reynolds

Research output: Chapter in Book/Conference paperConference paper

Abstract

© Springer International Publishing Switzerland 2015. There is a bundled variant, BCTL*, of the branching time logic CTL* which allows reasoning about models with fairness constraints on the possible futures. However, the stronger branching logic ATL*, which is well suited to reasoning about multi-agent systems, has no bundled variant. Schedulers, humans and so on may also exhibit “fair” behaviour that only manifests in the limit, motivating a similar variant of ATL*. In this paper we (1) show how to define a non-trivial Bundled variant of ATL* (BATL*); (2) Present a 2EXPTIME tableau for BATL* (so showing BATL* is 2EXPTIME-complete); (3) prove the correctness of the tableau; and (4) provide an implementation that can decide simple formulas for BATL* and another “non-local” variant NL-BCTL* that is well suited to verifying rewrite rules for ATL*.
Original languageEnglish
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods
Place of PublicationSwitzerland
PublisherSpringer-Verlag London Ltd.
Pages22-37
Volume9323
ISBN (Print)9783319243115
DOIs
Publication statusPublished - 2015
EventA tableau for bundled strategies - Wroclaw, Poland
Duration: 1 Jan 2015 → …

Conference

ConferenceA tableau for bundled strategies
Period1/01/15 → …

Fingerprint

Dive into the research topics of 'A tableau for bundled strategies'. Together they form a unique fingerprint.

Cite this