On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems

DOI10.1007/978-3-319-24953-7_27zbMath1471.68158OpenAlexW2295019212MaRDI QIDQ3460579

Steen Vester

Publication date: 8 January 2016

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/84e1d941-3637-47e1-ba9b-affff738cd81

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (2)

Reasoning about Quality and Fuzziness of Strategic Behaviors ⋮ On the complexity of resource-bounded logics

This page was built for publication: On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems