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

Multi agent systems

Cite this

Mccabe-Dansted, J., & Reynolds, M. (2015). A tableau for bundled strategies. In Automated Reasoning with Analytic Tableaux and Related Methods (Vol. 9323, pp. 22-37). Switzerland: Springer-Verlag London Ltd.. https://doi.org/10.1007/978-3-319-24312-2_3
Mccabe-Dansted, John ; Reynolds, Mark. / A tableau for bundled strategies. Automated Reasoning with Analytic Tableaux and Related Methods. Vol. 9323 Switzerland : Springer-Verlag London Ltd., 2015. pp. 22-37
@inproceedings{b3bed3d0343f4b8c91ef6fb364ededa2,
title = "A tableau for bundled strategies",
abstract = "{\circledC} 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*.",
author = "John Mccabe-Dansted and Mark Reynolds",
year = "2015",
doi = "10.1007/978-3-319-24312-2_3",
language = "English",
isbn = "9783319243115",
volume = "9323",
pages = "22--37",
booktitle = "Automated Reasoning with Analytic Tableaux and Related Methods",
publisher = "Springer-Verlag London Ltd.",
address = "Germany",

}

Mccabe-Dansted, J & Reynolds, M 2015, A tableau for bundled strategies. in Automated Reasoning with Analytic Tableaux and Related Methods. vol. 9323, Springer-Verlag London Ltd., Switzerland, pp. 22-37, A tableau for bundled strategies, 1/01/15. https://doi.org/10.1007/978-3-319-24312-2_3

A tableau for bundled strategies. / Mccabe-Dansted, John; Reynolds, Mark.

Automated Reasoning with Analytic Tableaux and Related Methods. Vol. 9323 Switzerland : Springer-Verlag London Ltd., 2015. p. 22-37.

Research output: Chapter in Book/Conference paperConference paper

TY - GEN

T1 - A tableau for bundled strategies

AU - Mccabe-Dansted, John

AU - Reynolds, Mark

PY - 2015

Y1 - 2015

N2 - © 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*.

AB - © 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*.

U2 - 10.1007/978-3-319-24312-2_3

DO - 10.1007/978-3-319-24312-2_3

M3 - Conference paper

SN - 9783319243115

VL - 9323

SP - 22

EP - 37

BT - Automated Reasoning with Analytic Tableaux and Related Methods

PB - Springer-Verlag London Ltd.

CY - Switzerland

ER -

Mccabe-Dansted J, Reynolds M. A tableau for bundled strategies. In Automated Reasoning with Analytic Tableaux and Related Methods. Vol. 9323. Switzerland: Springer-Verlag London Ltd. 2015. p. 22-37 https://doi.org/10.1007/978-3-319-24312-2_3