An automata-theoretic approach to branching-time model checking
From MaRDI portal
Publication:5385339
DOI10.1145/333979.333987zbMath1133.68376MaRDI QIDQ5385339
Moshe Y. Vardi, Orna Kupferman, Pierre Wolper
Publication date: 5 May 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/333979.333987
Related Items
Permissive strategies: from parity games to safety games, The regular viewpoint on PA-processes, An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus, On the expressivity and complexity of quantitative branching-time temporal logics, On feasible cases of checking multi-agent systems behavior., On temporal logic versus Datalog, Symbolic model checking for \(\mu\)-calculus requires exponential time, PSPACE-completeness of modular supervisory control problems, Distributed automata in an assumption-commitment framework, Complexity of weak acceptance conditions in tree automata., Module checking, Fair simulation, On the complexity of verifying concurrent transition systems, Is your model checker on time? On the complexity of model checking for timed modal logics, Probabilistic temporal logics via the modal mu-calculus, Relating word and tree automata
Uses Software
