On the complexity of resource-bounded logics
We revisit decidability results for resource-bounded logics and use decision problems on vector addition systems with states (VASS) in order to establish complexity characterisations of (decidable) model checking problems. We show that the model checking problem for the logic RB+-ATL is 2EXPTIME-com...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Elsevier
2018
|
| Online Access: | https://eprints.nottingham.ac.uk/49359/ |