Unidirectional Channel Systems Can Be Tested - Theoretical Computer Science Access content directly
Conference Papers Year : 2012

Unidirectional Channel Systems Can Be Tested

Abstract

“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.
Fichier principal
Vignette du fichier
978-3-642-33475-7_11_Chapter.pdf (212.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01556219 , version 1 (04-07-2017)

Licence

Attribution

Identifiers

Cite

Petr Jančar, Prateek Karandikar, Philippe Schnoebelen. Unidirectional Channel Systems Can Be Tested. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.149-163, ⟨10.1007/978-3-642-33475-7_11⟩. ⟨hal-01556219⟩
88 View
100 Download

Altmetric

Share

Gmail Facebook X LinkedIn More