Parameterised Pushdown Systems with Non-Atomic Writes

DOI10.4230/LIPIcs.FSTTCS.2011.457zbMath1246.68156arXiv1109.6264OpenAlexW2154109182MaRDI QIDQ2911646

Matthew Hague

Publication date: 31 August 2012

Full work available at URL: https://arxiv.org/abs/1109.6264

zbMATH Keywords

verificationreachabilityconcurrencypushdown systemsnon-atomicityparameterised systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Liveness in broadcast networks ⋮ Reachability for Dynamic Parametric Processes ⋮ Model checking parameterized asynchronous shared-memory systems ⋮ Fine-grained complexity of safety verification ⋮ On the Complexity of Bounded Context Switching.

Uses Software

• Bebop

This page was built for publication: Parameterised Pushdown Systems with Non-Atomic Writes