The following pages link to (Q2754072):
Displayed 18 items.
- Efficient CTL model-checking for pushdown systems (Q402129) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Analyzing pushdown systems with stack manipulation (Q1706143) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- (Q2842876) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)
- (Q4972731) (← links)
- Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
- The Complexity of Flat Freeze LTL (Q5111647) (← links)