%0 Conference Proceedings
%T Unidirectional Channel Systems Can Be Tested
%+ Technical University of Ostrava [Ostrava] (VSB)
%+ Chennai Mathematical Institute [Inde]
%+ Laboratoire Spécification et Vérification [Cachan] (LSV)
%A Jančar, Petr
%A Karandikar, Prateek
%A Schnoebelen, Philippe
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 7th International Conference on Theoretical Computer Science (TCS)
%C Amsterdam, Netherlands
%Y Jos C. M. Baeten
%Y Tom Ball
%Y Frank S. Boer
%I Springer
%3 Theoretical Computer Science
%V LNCS-7604
%P 149-163
%8 2012-09-26
%D 2012
%R 10.1007/978-3-642-33475-7_11
%Z Computer Science [cs]Conference papers
%X “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 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.
%G English
%Z TC 1
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-01556219/document
%2 https://inria.hal.science/hal-01556219/file/978-3-642-33475-7_11_Chapter.pdf
%L hal-01556219
%U https://inria.hal.science/hal-01556219
%~ CNRS
%~ ENS-CACHAN
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-TC2
%~ IFIP-TCS
%~ IFIP-WG2-2
%~ IFIP-LNCS-7604
%~ LSV-AUTO
%~ FARMAN
%~ ENS-PARIS-SACLAY