2026-07-20T05:38:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3348 2024-03-06T10:34:07Z ddc:004 open_access

Parameterised Pushdown Systems with Non-Atomic Writes Hague, Matthew Verification Concurrency Pushdown Systems Reachability Parameterised Systems Non-atomicity We consider the master/slave parameterised reachability problem for networks of pushdown systems, where communication is via a global store using only non-atomic reads and writes. We show that the control-state reachability problem is decidable. As part of the result, we provide a constructive extension of a theorem by Ehrenfeucht and Rozenberg to produce an NFA equivalent to certain kinds of CFG. Finally, we show that the non-parameterised version is undecidable. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Matthew Hague 2011 Is Part Of LIPIcs, Volume 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2011.457 urn:nbn:de:0030-drops-33485 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.457 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode