VLDL satisfiability and model checking via tree automata
From MaRDI portal
(Redirected from Publication:5136340)
Recommendations
Cites work
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Alternating-time temporal logic
- Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
- From linear time to branching time
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 3866588 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1775458 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Nondeterministic Tree Automata
- Tools and Algorithms for the Construction and Analysis of Systems
- Visibly linear dynamic logic
- Visibly linear temporal logic
- Visibly pushdown languages
Cited in
(3)
This page was built for publication: VLDL satisfiability and model checking via tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136340)