Data Communicating Processes with Unreliable Channels

Cyriac, Aiswarya (author): Uppsala universitet,Datorteknik,Chennai Math Inst, Madras, Tamil Nadu, India.

(creator_code:org_t)

2016
2016
English.
In: Proceedings Of The 31St Annual ACM-IEEE Symposium On Logic In Computer Science (LICS 2016). - 9781450343916 ; , s. 166-175

Abstract Subject headings

We extend the classical model of lossy channel systems by considering systems that operate on a finite set of variables ranging over an infinite data domain. Furthermore, each message inside a channel is equipped with a data item representing its value. Although we restrict the model by allowing the variables to be only tested for (dis-)equality, we show that the state reachability problem is undecidable. In light of this negative result, we consider bounded-phase reachability, where the processes are restricted to performing either send or receive operations during each phase. We show decidability of state reachability in this case by computing a symbolic encoding of the set of system configurations that are reachable from a given configuration.

By the author/editor: Abdulla, Parosh ...; Cyriac, Aiswarya; Atig, Mohamed Fa ...

About the subject

NATURAL SCIENCES: NATURAL SCIENCES; and Computer and Inf ...; and Computer Science ...

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.