License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2011.457
URN: urn:nbn:de:0030-drops-33485
URL: http://drops.dagstuhl.de/opus/volltexte/2011/3348/

Hague, Matthew

Parameterised Pushdown Systems with Non-Atomic Writes

pdf-format:
Dokument 1.pdf (396 KB)


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.

BibTeX - Entry

@InProceedings{hague:LIPIcs:2011:3348,
  author =	{Matthew Hague},
  title =	{{Parameterised Pushdown Systems with Non-Atomic Writes}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
  pages =	{457--468},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-34-7},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{13},
  editor =	{Supratik Chakraborty and Amit Kumar},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3348},
  URN =		{urn:nbn:de:0030-drops-33485},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.457},
  annote =	{Keywords: Verification, Concurrency, Pushdown Systems, Reachability, Parameterised Systems, Non-atomicity }
}

Keywords: Verification, Concurrency, Pushdown Systems, Reachability, Parameterised Systems, Non-atomicity
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Issue date: 2011
Date of publication: 01.12.2011


DROPS-Home | Fulltext Search | Imprint Published by LZI