PDL inside the -calculus: a syntactic and an automata-theoretic characterization

MaRDI QIDQ4636286zbMATH OpenFDO

Authors Facundo Carreiro, Yde Venema

Publication date 23 April 2018

zbMATH Keywords

automata theorypropositional dynamic logicmodal \(\mu\)-calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Recommendations

• Results on the propositional \(\mu\)-calculus
• The propositional dynamic logic of deterministic, well-structured programs
• Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
• scientific article; zbMATH DE number 1114354
• Automata for the modal \(\mu \)-calculus and related results

Cited in

(5)

• A propositional dynamic logic for instantial neighborhood semantics
• The influence of the test operator on the expressive power of PDL-like logics
• scientific article; zbMATH DE number 4039864 (Why is no real title available?)
• Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
• PDL is the bisimulation-invariant fragment of weak chain logic

This page was built for publication: PDL inside the \(\mu\)-calculus: a syntactic and an automata-theoretic characterization

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