Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
From MaRDI portal
Publication:2957490
DOI10.4230/LIPICS.FSTTCS.2012.173zbMath1354.68198OpenAlexW2122095746MaRDI QIDQ2957490
Salvatore La Torre, Gennaro Parlato
Publication date: 26 January 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3856/pdf/17.pdf
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 (13)
Realizability of concurrent recursive programs ⋮ Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Automated Synthesis of Distributed Controllers ⋮ On Distributed Monitoring and Synthesis ⋮ The complexity of model checking multi-stack systems ⋮ Towards compositional graph theory ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Budget-bounded model-checking pushdown systems ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Visibly pushdown modular games ⋮ On the path-width of integer linear programming ⋮ Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata ⋮ Data Multi-Pushdown Automata
This page was built for publication: Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
