Modular games for coalgebraic fixed point logics
From MaRDI portal
Recommendations
Cites work
- A compositional approach to defining logics for coalgebras
- A logic for reasoning about time and reliability
- A noninterleaving model of concurrency based on transition systems with spatial structure
- Alternating tree automata, parity games, and modal -calculus
- Anytime, anywhere: modal logics for mobile ambients
- Automata and fixed point logic: a coalgebraic perspective
- Automata for the modal -calculus and related results
- Automata, logics, and infinite games. A guide to current research
- Coalgebraic Epistemic Update Without Change of Model
- Coalgebraic logic
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Decidability of DPDA equivalence
- Fixed point characterization of infinite behavior of finite-state systems
- Foundations of Software Science and Computational Structures
- scientific article; zbMATH DE number 1497882 (Why is no real title available?)
- Logics for epistemic programs
- Modular construction of complete coalgebraic logics
- Probabilistic extensions of process algebras.
- Results on the propositional \(\mu\)-calculus
Cited in
(7)- Coinductive predicates and final sequences in a fibration
- Generic infinite traces and path-based coalgebraic temporal logics
- A note on the coalgebraic interpretation of game logic
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Coinductive predicates and final sequences in a fibration
- Games for topological fixpoint logic
- Maximal traces and path-based coalgebraic temporal logics
This page was built for publication: Modular games for coalgebraic fixed point logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873663)