ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS

DOI10.1142/S0129054114400255zbMath1309.68128OpenAlexW2118675136MaRDI QIDQ5247176

Mohamed Faouzi Atig, Prakash Saivasan, K. Narayan Kumar

Publication date: 23 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054114400255

zbMATH Keywords

reachability problemconcurrent pushdown systemsLTL model-checkingrecursive Boolean programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

Ordered multi-stack visibly pushdown automata ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Unnamed Item ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ Scope-Bounded Pushdown Languages ⋮ Data Multi-Pushdown Automata

Cites Work

• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS

This page was built for publication: ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS