On Reachability for Unidirectional Channel Systems Extended with Regular Tests
نویسندگان
چکیده
“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 elaborate reduction to a generalized version of Post’s Embedding Problem.
منابع مشابه
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg, a further variant where solutions are constrained and must belong to a given regular language. PEPreg is decidable but not primitive recursive. This entails the decidability of reachability for unidirectional systems with one reliable and one lossy channel.
متن کاملSubwords: automata, embedding problems, and verification
The increasing use of software and automated systems has made it important to ensure their correct behaviour. Bugs can not only have significant financial costs, but also catastrophic consequences in mission-critical systems. Testing against a variety of environments and inputs helps with discovering bugs, but cannot guarantee their absence. Formal verification is the technique that establishes...
متن کاملUnidirectional Channel Systems Can Be Tested
" Unidirectional channel systems " (Chambart & Schnoebelen, CONCUR 2008) are systems where one-way communication from a sender to a receiver goes via one reliable and one unreliable (unbounded fifo) channel. Equipping these systems with the possibility of testing regular properties on the contents of channels makes verification undecidable. Decidability is preserved when only emptiness and none...
متن کاملWhat is Decidable about Perfect Timed Channels?
In this paper, we introduce the model of communicating timed automata (CTA) that extends the classical models of finite-state processes communicating through FIFO perfect channels and timed automata, in the sense that the finite-state processes are replaced by timed automata, and messages inside the perfect channels are equipped with clocks representing their ages. In addition to the standard o...
متن کاملThe ω-Regular Post Embedding Problem
Post’s Embedding Problem is a new variant of Post’s Correspondence Problem where words are compared with embedding rather than equality. It has been shown recently that adding regular constraints on the form of admissible solutions makes the problem highly non-trivial, and relevant to the study of lossy channel systems. Here we consider the infinitary version and its application to recurrent re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logical Methods in Computer Science
دوره 11 شماره
صفحات -
تاریخ انتشار 2014