verification is more difficult, since most verification problems are in general undecidable. In this paper, we consider the verification of a particular class of infinite-state systems, namely systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels. This class is able

Layered communication protocols frequently implement a FIFO message facility On top of an unreliable non-FIFO service such as that provided by a packet-switching network. This paper investigates the possibility of implementing a reliable message layer on top of an underlying layer that can lose

Abstract—It has been recently discovered that heavy-tailed file completion time can result from protocol interaction even when file sizes are light-tailed. A key to this phenomenon is the RESTART feature where if a file transfer is interrupted before it is completed, the transfer needs to restart from the beginning. In this paper, we show that independent or bounded fragmentation produces light-tailed file completion time as long as the file size is light-tailed, i.e., in this case, heavy-tailed file completion time can only originate from heavy-tailed file sizes. If the file size is heavy-tailed, then the file completion time is clearly heavy-tailed. For this case, we show that when the file size distribution is regularly varying, then under independent or bounded fragmentation, the completion time tail distribution function is asymptotically upper bounded by that of the original file size stretched by a constant factor. We then prove that if the

such as Propositional Linear Time Temporal Logic (PTL) and Computation Tree Logic (CTL). ffl The problem of deciding eventuality properties with fair channels: do all computations eventually reach a given set of states if the unreliable channels satisfy fairness assumptions. The results are obtained through a

This paper studies LTI one-degree-of-freedom networked control architectures built around LTI SISO plants. The feedback path comprises an unreliable channel that drops data in an i.i.d. fashion. We extend known results to show that there exists a second order moments equivalence between

Abstract — The research in the literature on the design of image security by using Arithmetic Coding and Advanced Encryption Standard. Arithmetic Coding offers extremely high coding efficiency and it provides little or no security as traditionally implemented. We present a modified scheme that offers both security and compression of images. The system utilizes an Arithmetic Coder and Advanced Encryption Standard in which the overall length within the range allocated to each symbol is preserved. The overall system provides simultaneous compression and encryption with negligible coding efficiency by accelerated hardware implementations.

Abstract not found

of diagonals covered by the index assignment. We consider here the usage of multiple description uniform scalar quantization (that we call MDUSQ) for robust and progressive transmission of images over unreliable channels. The progressive feature is an important factor for rate control in non stationary

It is proved that any protocol that constructs a reliable data link service using a physical channel service necessarily includes in the packets some header information that enables the protocol to treat different packets differently. The physical channel considered is permitted to lose

An error-resilient coding scheme is proposed for the transmission of images over unreliable channels. Forward Error Correction is used in conjunction with the error-resilient source coder for the protection of the compressed stream. Unlike almost all other robust coding schemes presented todate