Verifying communicating multi-pushdown systems via split-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
Cited in
(14)- Realizability of concurrent recursive programs
- Leafy automata for higher-order concurrency
- The complexity of model checking multi-stack systems
- Verification of parameterized communicating automata via split-width
- MSO decidability of multi-pushdown systems via split-width
- Controllers for the verification of communicating multi-pushdown systems
- scientific article; zbMATH DE number 7471708 (Why is no real title available?)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
- Data multi-pushdown automata
- Decidable models of integer-manipulating programs with recursive parallelism
- Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
- Forwards- and backwards-reachability for cooperating multi-pushdown systems
- Backwards-reachability for cooperating multi-pushdown systems
- Weighted tiling systems for graphs: evaluation complexity
This page was built for publication: Verifying communicating multi-pushdown systems via split-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457774)