Size measures and alphabetic equivalence in the \(\mu \)-calculus
From MaRDI portal
Publication:6649448
DOI10.1145/3531130.3533339WikidataQ130860087 ScholiaQ130860087MaRDI QIDQ6649448
Johannes Marti, Yde Venema, Clemens Kupke
Publication date: 6 December 2024
Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Results on the propositional \(\mu\)-calculus
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Temporal logics in computer science. Finite-state systems
- Automata for the modal μ-calculus and related results
- On guarded transformation in the modal -calculus
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- Deciding parity games in quasipolynomial time
- Rudiments of \(\mu\)-calculus
- Modal and temporal properties of processes
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication: Size measures and alphabetic equivalence in the \(\mu \)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649448)
