Pages that link to "Item:Q1854405"
From MaRDI portal
The following pages link to Pushdown processes: Games and model-checking (Q1854405):
Displaying 22 items.
- Linear-time temporal logics with Presburger constraints: an overview ★ (Q3647243) (← links)
- (Q4558784) (← links)
- <i>μ</i>-Bicomplete Categories and Parity Games (Q4787834) (← links)
- (Q5005144) (← links)
- (Q5013876) (← links)
- (Q5015366) (← links)
- (Q5028456) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
- Domains for Higher-Order Games (Q5111275) (← links)
- Automata, Logic and Games for the $$\lambda $$ -Calculus (Q5224488) (← links)
- (Q5232911) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- Automated Technology for Verification and Analysis (Q5394227) (← links)
- Three notes on the complexity of model checking fixpoint logic with chop (Q5441546) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465872) (← links)
- A Branching Time Variant of CaRet (Q5883579) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Topological properties of omega context-free languages (Q5958141) (← links)
- Free \(\mu\)-lattices (Q5960406) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)
- Round- and context-bounded control of dynamic pushdown systems (Q6564172) (← links)