Thakkar, Jay and Kanade, Aditya (2015) Non-deterministic transducer models of retransmission protocols over noisy channels. In: INFORMATION PROCESSING LETTERS, 115 (9). pp. 694-698.
PDF
Inf_Pro_Let_115-9_694_2015.pdf - Published Version Restricted to Registered users only Download (320kB) | Request a copy |
Abstract
Retransmission protocols such as HDLC and TCP are designed to ensure reliable communication over noisy channels (i.e., channels that can corrupt messages). Thakkar et al. 15] have recently presented an algorithmic verification technique for deterministic streaming string transducer (DSST) models of such protocols. The verification problem is posed as equivalence checking between the specification and protocol DSSTs. In this paper, we argue that more general models need to be obtained using non-deterministic streaming string transducers (NSSTs). However, equivalence checking is undecidable for NSSTs. We present two classes where the models belong to a sub-class of NSSTs for which it is decidable. (C) 2015 Elsevier B.V. All rights reserved.
Item Type: | Journal Article |
---|---|
Publication: | INFORMATION PROCESSING LETTERS |
Publisher: | ELSEVIER SCIENCE BV |
Additional Information: | Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS |
Keywords: | Formal methods; Protocols; Noisy channels; String transducers |
Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
Date Deposited: | 31 Jul 2015 10:20 |
Last Modified: | 31 Jul 2015 10:20 |
URI: | http://eprints.iisc.ac.in/id/eprint/51938 |
Actions (login required)
View Item |