Modal μ-Calculus and Alternating Tree Automata

DOI10.1007/3-540-36387-4_10MaRDI QIDQ4412833zbMATH OpenOpenAlexFDO

Authors Júlia Zappe

Publication date 16 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36387-4_10

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automata for the modal -calculus and related results
• Modal logics and mu-calculi: An introduction
• Rudiments of \(\mu\)-calculus
• Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
• Alternating tree automata, parity games, and modal -calculus

Cited in

(13)

• On modal -calculus and non-well-founded set theory
• Mu-calculus satisfiability with arithmetic constraints
• Modal logics and mu-calculi: An introduction
• scientific article; zbMATH DE number 1696780 (Why is no real title available?)
• The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
• Automata for the modal -calculus and related results
• A tableau system for the modal -calculus
• scientific article; zbMATH DE number 1304338 (Why is no real title available?)
• scientific article; zbMATH DE number 1136070 (Why is no real title available?)
• scientific article; zbMATH DE number 2112326 (Why is no real title available?)
• Rudiments of \(\mu\)-calculus
• Alternating tree automata, parity games, and modal -calculus
• Causality-based game solving

This page was built for publication: Modal μ-Calculus and Alternating Tree Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412833)