Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations

DOI10.1007/978-3-642-23217-6_14zbMath1343.68172MaRDI QIDQ3090831

Margherita Napoli, Salvatore La Torre

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_14

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete, Unnamed Item, Unnamed Item, Unnamed Item, Ordered multi-stack visibly pushdown automata, Temporal logics for concurrent recursive programs: satisfiability and model checking, Budget-bounded model-checking pushdown systems, On the path-width of integer linear programming, Realizability of concurrent recursive programs, Reachability of scope-bounded multistack pushdown systems, On exteriority notions in book embeddings and treewidth, The complexity of model checking multi-stack systems, Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata

Cites Work

• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• An Infinite Automaton Characterization of Double Exponential Time
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
• The tree width of auxiliary storage
• Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Context-Bounded Analysis of Concurrent Queue Systems
• Tools and Algorithms for the Construction and Analysis of Systems