A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Context-Bounded Analysis of Concurrent Queue Systems
[chapter]
2008
Lecture Notes in Computer Science
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
doi:10.1007/978-3-540-78800-3_21
fatcat:7sa3ijlzqvft5ltank3szok7be