Results 1  10
of
65
Analysis of Video Transmission over Lossy Channels
 IEEE Journal on Selected Areas in Communications
, 2000
"... A theoretical analysis of the overall mean squared error (MSE) in hybrid video coding is presented for the case of error prone transmission. Our model covers the complete transmission system including the ratedistortion performance of the video encoder, forward error correction, interleaving, and t ..."
Abstract

Cited by 232 (29 self)
 Add to MetaCart
A theoretical analysis of the overall mean squared error (MSE) in hybrid video coding is presented for the case of error prone transmission. Our model covers the complete transmission system including the ratedistortion performance of the video encoder, forward error correction, interleaving
Timed lossy channel systems
 In: Proc. FSTTCS ’05, 32nd Conf. on Foundations of Software Technology and Theoretical Computer Science
, 2012
"... Abstract Lossy channel systems are a classical model with applications ranging from the modeling of communication protocols to programs running on weak memory models. All existing work assume that messages traveling inside the channels are picked from a finite alphabet. In this paper, we extend the ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract Lossy channel systems are a classical model with applications ranging from the modeling of communication protocols to programs running on weak memory models. All existing work assume that messages traveling inside the channels are picked from a finite alphabet. In this paper, we extend
An Improved Search Strategy for Lossy Channel Systems
"... In [1] we considered lossy channel systems which are a particular class of infinite state systems consisting of finite state processes communicating through channels that are unbounded and unreliable. We presented a backward reachability algorithm which, starting from a set of "bad &qu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In [1] we considered lossy channel systems which are a particular class of infinite state systems consisting of finite state processes communicating through channels that are unbounded and unreliable. We presented a backward reachability algorithm which, starting from a set of "bad &
An Improved Search Strategy for Lossy
"... Abstract In [1] we considered lossy channel systems which are a particular class of infinite state systems consisting of finite state processes communicating through channels that are unbounded and unreliable. We presented a backward reachability algorithm which, starting from a set of "bad ..."
Abstract
 Add to MetaCart
Abstract In [1] we considered lossy channel systems which are a particular class of infinite state systems consisting of finite state processes communicating through channels that are unbounded and unreliable. We presented a backward reachability algorithm which, starting from a set of &
Lossy communication of correlated sources over multiple access channels
 Proceedings of Allerton Conference on Communication, Control, and Computing
, 2010
"... Abstract—A new approach to joint source–channel coding is presented in the context of communicating correlated sources over multiple access channels. Similar to the separation architecture, the joint source–channel coding system architecture in this approach is modular, whereby the source encoding ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
as special cases previous results on lossless communication of correlated sources over multiple access channels by Cover, El Gamal, and Salehi, distributed lossy source coding by Berger and Tung, and lossy communication of the bivariate Gaussian source over the Gaussian multiple access channel by Lapidoth
Incremental, Inductive Coverability
"... Abstract. We give an incremental, inductive (IC3) procedure to check coverability of wellstructured transition systems. Our procedure generalizes the IC3 procedure for safety verification that has been successfully applied in finitestate hardware verification to infinitestate wellstructured tr ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
structured transition systems. We show that our procedure is sound, complete, and terminating for downwardfinite wellstructured transition systems —where each state has a finite number of states below it — a class that contains extensions of Petri nets, broadcast protocols, and lossy channel systems. We have
Covering Sharing Trees: A Compact Data Structure for Parameterized Verification
"... The control state reachability problem is decidable for wellstructured infinitestate systems like (Lossy) Petri Nets, Vector Addition Systems, and Broadcast Protocols. An abstract algorithm that solves the problem is the backward reachability algorithm of [1,21]. The algorithm computes the closure ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
The control state reachability problem is decidable for wellstructured infinitestate systems like (Lossy) Petri Nets, Vector Addition Systems, and Broadcast Protocols. An abstract algorithm that solves the problem is the backward reachability algorithm of [1,21]. The algorithm computes
CSTs (Covering Sharing Trees): Compact Data Structures for Parameterized Verification
 Software Tools for Technology Transfer, 2001. 98
"... The control state reachability problem is decidable for wellstructured in finitestate systems like unbounded Petri Nets, Vector Addition Systems, Lossy Petri Nets, and Broadcast Protocols. An abstract algorithm that solves the problem is given in [A CJT96, FS01]. The algorithm computes the closure ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The control state reachability problem is decidable for wellstructured in finitestate systems like unbounded Petri Nets, Vector Addition Systems, Lossy Petri Nets, and Broadcast Protocols. An abstract algorithm that solves the problem is given in [A CJT96, FS01]. The algorithm computes
Comparing the Expressive Power of Wellstructured Transition Systems
, 2007
"... We compare the expressive power of a class of wellstructured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewriting systems. For each one of these models we study the class of languages generated by labelled transition systems des ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
We compare the expressive power of a class of wellstructured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewriting systems. For each one of these models we study the class of languages generated by labelled transition systems
Expand, Enlarge and Check. . . Made Efficient
 IN LECTURE NOTES IN COMPUTER SCIENCE
, 2005
"... The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symbolic backward reachability. In a recent paper, we have introduced the theory underlying a new algorithmic solution, called `E ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symbolic backward reachability. In a recent paper, we have introduced the theory underlying a new algorithmic solution, called
Results 1  10
of
65