Reasoning about memoryless strategies under partial observability and unconditional fairness constraints

Busard, S., Pecheur, C., Qu, H. et al. (1 more author) (2015) Reasoning about memoryless strategies under partial observability and unconditional fairness constraints. Information and Computation, 242. pp. 128-156. ISSN 0890-5401

Abstract

Metadata

Authors/Creators:
  • Busard, S.
  • Pecheur, C.
  • Qu, H.
  • Raimondi, F.
Copyright, Publisher and Additional Information: © 2015 Elsevier Inc. This is an author produced version of a paper subsequently published in Information and Computation. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/)
Keywords: Alternating-time temporal logic; Partial observability; Fairness constraints; Model checking
Dates:
  • Published: 3 June 2015
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 02 Feb 2016 14:03
Last Modified: 25 Mar 2016 10:14
Published Version: http://dx.doi.org/10.1016/j.ic.2015.03.014
Status: Published
Publisher: Elsevier
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.ic.2015.03.014

Share / Export

Statistics