The University of Southampton
University of Southampton Institutional Repository

Context-Bounded Analysis of Concurrent Queue Systems

Torre, Salvatore La, Madhusudan, P. and Parlato, Gennaro (2008) Context-Bounded Analysis of Concurrent Queue Systems At TACAS, Hungary. 29 Mar - 06 Apr 2008. , pp. 299-314.

Record type: Conference or Workshop Item (Paper)


We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one queue (but is allowed to write onto all other queues). Our result also holds when individual processes are finite-state recursive programs provided a process dequeues messages only when its local stack is empty. We then proceed to classify architectures that admit a decidable (unbounded context switching) reachability problem, using the decidability of bounded context switching. We show that the precise class of decidable architectures for recursive programs are the forest architectures, while the decidable architectures for non-recursive programs are those that do not have an undirected cycle.

PDF fulltext(1).pdf - Version of Record
Download (490kB)

More information

Published date: 2008
Additional Information: Event Dates: March 29-April 6, 2008
Venue - Dates: TACAS, Hungary, 2008-03-29 - 2008-04-06
Organisations: Electronic & Software Systems


Local EPrints ID: 272462
ISBN: 978-3-540-78799-0
PURE UUID: 48ccb9ed-cc98-40d3-9308-c0e298f7c8ab

Catalogue record

Date deposited: 13 Jun 2011 14:29
Last modified: 18 Jul 2017 06:24

Export record


Author: Salvatore La Torre
Author: P. Madhusudan
Author: Gennaro Parlato

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.