Related papers: On Reachability for Unidirectional Channel Systems…
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers. This is a fundamental reachability problem for continuous linear dynamical systems,…
A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows only for one user each time. The application of efficient…
The degrees of freedom of MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interference alignment solution is a key step toward solving this open problem. Our…
We investigate the relationship between persistent currents in multi-channel rings containing an embedded scatterer and the conductance through the same scatterer attached to leads. The case of two uncoupled channels corresponds to a…
We present an alternative approach to the derivation of benchmarks for quantum channels, such as memory or teleportation channels. Using the concept of effective entanglement and the verification thereof, a testing procedure is derived…
Optical-to-mechanical quantum state transfer is an important capability for future quantum networks, quantum communication, and distributed quantum sensing. However, existing continuous state transfer protocols operate in the resolved…
A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…
We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance…
The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value,…
Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for…
Time-invariant finite-dimensional systems, under reasonable continuity assumptions, exhibit the property that if solutions exist for all future times, the set of vectors reachable from a bounded set of initial conditions over bounded time…
The problem of dephasing channel discrimination is addressed for finite-dimensional systems. In particular, the optimization with respect to input states without energy constraint is solved analytically for qubit, qutrit and ququart.…
A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and…
A completely depolarising quantum channel always outputs a fully mixed state and thus cannot transmit any information. In a recent Letter [D. Ebler et al., Phys. Rev. Lett. 120, 120502 (2018)], it was however shown that if a quantum state…
Many concurrent and distributed systems are safety-critical and therefore have to provide a high degree of assurance. Important properties of such systems are frequently proved on the specification level, but implementations typically…
In this paper, the secure transmission of information over an ergodic fading channel is investigated in the presence of statistical quality of service (QoS) constraints. We employ effective capacity, which provides the maximum constant…
Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria - linearizability with…
In PLDI'20, Lee et al. introduced the \emph{promising } semantics PS 2.0 of the C++ concurrency that captures most of the common program transformations while satisfying the DRF guarantee. The reachability problem for finite-state programs…
Joint message and state transmission under arbitrarily varying jamming is investigated in this paper. The problem is modeled as the transmission over a channel with random states with a fixed distribution and jamming that varies in an…
For information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback…