On the complexity of resource-bounded logics

Tools

Alechina, Natasha, Bulling, Nils, Demri, Stephane and Logan, Brian (2016) On the complexity of resource-bounded logics. In: 10th International Workshop on Reachability Problems (RP 2016), 19-12 September 2016, Aalborg, Denmark.

Full text not available from this repository.

Abstract

We revisit decidability results for resource-bounded logics and use decision problems for vector addition systems with states (VASS) to characterise the complexity of (decidable) model-checking problems.

We show that the model-checking problem for the logic RB+-ATL is 2EXPTIME-complete by using recent results on alternating VASS.

In addition, we establish that the model-checking problem for RBTL is decidable and has the same complexity as for RBTL* (the extension of RBTL with arbitrary path formulae), namely EXPSPACE-complete, proving a new decidability result as a by-product of the approach. Finally, we establish that the model-checking problem for RB+-ATL* is decidable by a reduction to parity games, and show how to synthesise values for resource parameters.

Item Type: Conference or Workshop Item (Paper)
RIS ID: https://nottingham-repository.worktribe.com/output/818023
Additional Information: In volume 9899 of Lecture Notes in Computer Science (doi:10.1007/978-3-319-45994-3_3)
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Alechina, Natasha
Date Deposited: 26 Sep 2016 14:27
Last Modified: 04 May 2020 18:12
URI: https://eprints.nottingham.ac.uk/id/eprint/37145

Actions (Archive Staff Only)

Edit View Edit View