Noncommutative Burkholder/Rosenthal inequalities II: applications

We show norm estimates for the sum of independent random variables in noncommutative $L_p$-spaces for $1<p<\infty$ following our previous work. These estimates generalize the classical Rosenthal inequality in the commutative case. Among applications, we derive an equivalence for the $p$-norm of the singular values of a random matrix with independent entries, and characterize those symmetric subspaces and unitary ideals which can be realized as subspaces of a noncommutative $L_p$ for $2<p<\infty$.Comment: To appear in Isreal J; Mat

Implementation relations for testing through asynchronous channels

This paper concerns testing from an input output transition system (IOTS) model of a system under test that interacts with its environment through asynchronous first in first out (FIFO) channels. It explores methods for analysing an IOTS without modelling the channels. If IOTS M produces sequence $\sigma$ then, since communications are asynchronous, output can be delayed and so a different sequence might be observed. Thus M defines a language Tr(M) of sequences that can be observed when interacting with M through FIFO channels. We define implementation relations and equivalences in terms of Tr(M): an implementation relation says how IOTS N must relate to IOTS M in order for N to be a correct implementation of M. It is important to use an appropriate implementation relation since otherwise the verdict from a test run might be incorrect and because it influences test generation. It is undecidable whether IOTS N conforms to IOTS M and so also whether there is a test case that can distinguish between two IOTSs. We also investigate the situation in which we have a finite automaton P and either wish to know whether $Tr(M) \cap L(P)$ is empty or whether Tr(M) \cap \tr(P) is empty and prove that these are undecidable. In addition, we give conditions under which conformance and intersection are decidable.This work was partially supported by EPSRC grant EP/G04354X/1:The Birth, Life and Death of Semantic Mutants

Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

On the central and local limit theorem for martingale difference sequences

Let (\Omega, \A, \mu) be a Lebesgue space and $T$ an ergodic measure preserving automorphism on $\Omega$ with positive entropy. We show that there is a bounded and strictly stationary martingale difference sequence defined on $\Omega$ with a common non-degenerate lattice distribution satisfying the central limit theorem with an arbitrarily slow rate of convergence and not satisfying the local limit theorem. A similar result is established for martingale difference sequences with densities provided the entropy is infinite. In addition, the martingale difference sequence may be chosen to be strongly mixing.Comment: Accepte pour publication dans Stochastics and Dynamic