MSO decidability of multi-pushdown systems via split-width
From MaRDI portal
Recommendations
Cited in
(18)- Bounded context switching for valence systems
- Reachability of scope-bounded multistack pushdown systems
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Verifying communicating multi-pushdown systems via split-width
- Analyzing timed systems using tree automata
- Verification of parameterized communicating automata via split-width
- Revisiting underapproximate reachability for multipushdown systems
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- On the complexity of multi-pushdown games
- Weighted tiling systems for graphs: evaluation complexity
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- The complexity of model checking multi-stack systems
- scientific article; zbMATH DE number 7561325 (Why is no real title available?)
- On exteriority notions in book embeddings and treewidth
- Data multi-pushdown automata
- Realizability of concurrent recursive programs
- Towards an Efficient Tree Automata based technique for Timed Systems
This page was built for publication: MSO decidability of multi-pushdown systems via split-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912701)