Pages that link to "Item:Q2912701"
From MaRDI portal
The following pages link to MSO Decidability of Multi-Pushdown Systems via Split-Width (Q2912701):
Displayed 14 items.
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Realizability of concurrent recursive programs (Q1620953) (← links)
- Reachability of scope-bounded multistack pushdown systems (Q2216111) (← links)
- On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Verification of Parameterized Communicating Automata via Split-Width (Q2811340) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete (Q4639894) (← links)
- (Q4643961) (← links)
- Bounded Context Switching for Valence Systems (Q5009426) (← links)
- Revisiting Underapproximate Reachability for Multipushdown Systems (Q5039520) (← links)
- (Q5090956) (← links)
- Data Multi-Pushdown Automata (Q5111652) (← links)
- Towards an Efficient Tree Automata based technique for Timed Systems (Q5111654) (← links)