Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
From MaRDI portal
Recommendations
- Precedence-constrained arborescences
- Constrained dynamic tree networks
- Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
- scientific article; zbMATH DE number 3848941
- Model checking dynamic pushdown networks
- Model checking dynamic pushdown networks
- Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Cited in
(12)- Constrained dynamic tree networks
- Model checking dynamic pushdown networks
- Reachability for dynamic parametric processes
- Forward analysis of dynamic network of pushdown systems is easier without order
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
- Model checking concurrent programs
- Verification of higher-order concurrent programs with dynamic resource creation
- Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
- Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
- Using dynamic pushdown networks to automate a modular information-flow analysis
- scientific article; zbMATH DE number 7682282 (Why is no real title available?)
- Model-checking parametric lock-sharing systems against regular constraints
This page was built for publication: Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636879)
