Parameterised Pushdown Systems with Non-Atomic Writes
Formal Languages and Automata Theory
2011-09-29 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1109.6264,
title = {Parameterised Pushdown Systems with Non-Atomic Writes},
author = {Matthew Hague},
journal= {arXiv preprint arXiv:1109.6264},
year = {2011}
}
Comments
This is the long version of a paper appearing in FSTTCS 2011