The following pages link to STACS 2004 (Q5309728):
Displaying 11 items.
- A saturation method for the modal \(\mu \)-calculus over pushdown systems (Q532393) (← links)
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus (Q1801498) (← links)
- Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- (Q3384882) (← links)
- Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
- (Q4381381) (← links)
- On guarded transformation in the modal -calculus (Q4644509) (← links)
- (Q5021004) (← links)
- Efficient Algorithms for Omega-Regular Energy Games (Q6488464) (← links)