Pages that link to "Item:Q5899098"
From MaRDI portal
The following pages link to Foundations of Software Science and Computation Structures (Q5899098):
Displayed 15 items.
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Reachability on prefix-recognizable graphs (Q975403) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- Energy parity games (Q1758152) (← links)
- A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- (Q4972731) (← links)
- (Q5021006) (← links)
- Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
- The Complexity of Flat Freeze LTL (Q5111647) (← links)
- Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)
- Church synthesis on register automata over linearly ordered data domains (Q6151760) (← links)