On Reachability for Unidirectional Channel Systems Extended with Regular Tests

  title={On Reachability for Unidirectional Channel Systems Extended with Regular Tests},
  author={Petr Jan{\vc}ar and Prateek Karandikar and Philippe Schnoebelen},
  journal={Log. Methods Comput. Sci.},
"Unidirectional channel systems" (Chambart & Schnoebelen, CONCUR 2008) are finite-state systems where one-way communication from a Sender to a Receiver goes via one reliable and one unreliable unbounded fifo channel. While reachability is decidable for these systems, equipping them with the possibility of testing regular properties on the contents of channels makes it undecidable. Decidability is preserved when only emptiness and nonemptiness tests are considered: the proof relies on an… 
1 Citations

Figures from this paper

Subwords : automata, embedding problems, and verification
The Post Embedding Problem (PEP) is an algebraic abstraction of the reachability problem on LCS, with the same complexity, and is the champion for a "master" problem for the class F_{omega^omega}.


Unidirectional Channel Systems Can Be Tested
Decidability is preserved when only emptiness and nonemptiness tests are considered: the proof relies on a series of reductions eventually allowing us to take advantage of recent results on Post's Embedding Problem.
Safety Verification of Communicating One-Counter Machines
An under-approximative approach to the reachability problem, based on rendezvous synchronization is considered, which extends communicating finite-state machines (CFSM) by infinite-state local processes and an infinite message alphabet.
Verifying Programs with Unreliable Channels
The verification of a particular class of infinite-state systems, namely, systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels, is considered and it is shown that several interesting verification problems are decidable by giving algorithms for verifying.
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
It is proved mainly that the reachability problem between recognizable sets of configurations is decidable for acyclic networks of pushdown systems, and that for lossy channel pushdown networks, the channel language is effectively recognizable.
Reachability Analysis of Communicating Pushdown Systems
The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability, and this work extends a model based on communicating pushdown systems that can dequeue with empty stack only, which adds the dual modality.
Decidable Topologies for Communicating Automata with FIFO and Bag Channels
This paper provides a complete characterisation of the decidable topologies in this generalised setting where the topology contains both FIFO and bag channels, and it is shown that the reachability problem is decidable for any topology by a simple reduction to Petri nets.
Mixing Lossy and Perfect Fifo Channels
This work provides a complete classification of network topologies according to whether they lead to a decidable reachability problem and can be decided in polynomial-time.
Reachability of Communicating Timed Processes
A complete characterization of decidable and undecidable communication topologies, for both discrete and dense time, and complexity results, by showing that communicating timed processes are at least as hard as Petri nets.
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
We prove a general finite convergence theorem for “upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured
Context-Bounded Analysis of Concurrent Queue Systems
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