Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Reachability of scope-bounded multistack pushdown systems
- Reachability of multistack pushdown systems with scope-bounded matching relations
- scientific article; zbMATH DE number 125878
- MSO decidability of multi-pushdown systems via split-width
- On the power of bounded concurrency II
- Model-checking bounded multi-pushdown systems
- On the expressive power of higher-order pushdown systems
- Pushdown reachability with constant treewidth
- A unifying approach for multistack pushdown automata
Cited in
(16)- Realizability of concurrent recursive programs
- Reachability of scope-bounded multistack pushdown systems
- The complexity of model checking multi-stack systems
- Context-free ambiguity detection using multi-stack pushdown automata
- MSO decidability of multi-pushdown systems via split-width
- Reachability of multistack pushdown systems with scope-bounded matching relations
- On Distributed Monitoring and Synthesis
- Automated synthesis of distributed controllers
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- Budget-bounded model-checking pushdown systems
- Revisiting underapproximate reachability for multipushdown systems
- Data multi-pushdown automata
- Visibly pushdown modular games
- On the path-width of integer linear programming
- Towards compositional graph theory
- Scope-Bounded Reachability in Valence Systems
This page was built for publication: Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957490)
