Satisfiability Games for Branching-Time Logics

DOI10.2168/LMCS-9(4:5)2013zbMath1312.03023arXiv1308.5165OpenAlexW2028860036MaRDI QIDQ2851673

Oliver Friedmann, Markus Latte, Martin Lange

Publication date: 16 October 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.5165

zbMATH Keywords

automataparity gamesdecidabilitytemporal logic

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Temporal logic (03B44)

Related Items (2)

A survey on satisfiability checking for the \(\mu \)-calculus through tree automata ⋮ Sublogics of a branching time logic of robustness

Uses Software

• PGSolver
• CTL-RP

This page was built for publication: Satisfiability Games for Branching-Time Logics