Pages that link to "Item:Q801893"
From MaRDI portal
The following pages link to Results on the propositional \(\mu\)-calculus (Q801893):
Displaying 32 items.
- Temporal Logic with Recursion. (Q6060093) (← links)
- The tail-recursive fragment of timed recursive CTL (Q6077845) (← links)
- On first-order runtime enforcement of branching-time properties (Q6090988) (← links)
- Revising system specifications in temporal logic (Q6097773) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q6104376) (← links)
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic (Q6104378) (← links)
- Symbolic control for stochastic systems via finite parity games (Q6122792) (← links)
- Fixed point logics and definable topological properties (Q6149964) (← links)
- Temporal logics with language parameters (Q6186316) (← links)
- Succinctness in subsystems of the spatial mu-calculus (Q6290036) (← links)
- A direct symbolic algorithm for solving stochastic Rabin games (Q6535608) (← links)
- Compositional verification of concurrent systems by combining bisimulations (Q6535949) (← links)
- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points (Q6541152) (← links)
- Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata (Q6541156) (← links)
- Canonicity of proofs in constructive modal logic (Q6541161) (← links)
- Model checking timed recursive CTL (Q6543268) (← links)
- Automated temporal reasoning about reactive systems (Q6560389) (← links)
- Modal and temporal logics for processes (Q6560391) (← links)
- Fast symbolic algorithms for omega-regular games under strong transition fairness (Q6566589) (← links)
- Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi (Q6597959) (← links)
- Complexity results for modal logic with recursion via translations and tableaux (Q6597964) (← links)
- Modal logic and planarity of graphs (Q6601689) (← links)
- Priority promotion with Parysian flair (Q6627044) (← links)
- Separating the expressive power of propositional dynamic and modal fixpoint logics (Q6643745) (← links)
- Defining logical obstruction with fixpoints in epistemic logic (Q6645916) (← links)
- Abstract cyclic proofs (Q6646012) (← links)
- An overview of the HFL model checking project (Q6647298) (← links)
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms (Q6647769) (← links)
- Size measures and alphabetic equivalence in the \(\mu \)-calculus (Q6649448) (← links)
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs (Q6649500) (← links)
- Filtration and canonical completeness for continuous modal \(\mu\)-calculi (Q6649525) (← links)
- Coalgebraic CTL: fixpoint characterization and polynomial-time model checking (Q6666771) (← links)
