MSO Decidability of Multi-Pushdown Systems via Split-Width

DOI10.1007/978-3-642-32940-1_38zbMath1364.68280OpenAlexW153330214MaRDI QIDQ2912701

Aiswarya Cyriac, K. Narayan Kumar, Paul Gastin

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32940-1_38

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (14)

Realizability of concurrent recursive programs ⋮ Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ The complexity of model checking multi-stack systems ⋮ Automata and Logics for Concurrent Systems: Five Models in Five Pages ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Temporal logics for concurrent recursive programs: satisfiability and model checking ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Bounded Context Switching for Valence Systems ⋮ Unnamed Item ⋮ Verification of Parameterized Communicating Automata via Split-Width ⋮ On exteriority notions in book embeddings and treewidth ⋮ Data Multi-Pushdown Automata ⋮ Towards an Efficient Tree Automata based technique for Timed Systems ⋮ Unnamed Item

This page was built for publication: MSO Decidability of Multi-Pushdown Systems via Split-Width