PDL with Intersection and Converse Is 2EXP-Complete

DOI10.1007/978-3-540-71389-0_15zbMath1180.03033OpenAlexW1793889125MaRDI QIDQ5758037

Stefan Göller, Markus Lohrey, Carsten Lutz

Publication date: 7 September 2007

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71389-0_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Run-Time Monitoring of Electronic Contracts ⋮ Public announcement logic with distributed knowledge: expressivity, completeness and complexity

This page was built for publication: PDL with Intersection and Converse Is 2EXP-Complete