Trace and Testing Metrics on Nondeterministic Probabilistic Processes

@article{Castiglioni2018TraceAT,
  title={Trace and Testing Metrics on Nondeterministic Probabilistic Processes},
  author={Valentina Castiglioni},
  journal={CoRR},
  year={2018},
  volume={abs/1808.08649},
  pages={19-36}
}
The combination of nondeterminism and probability in concurrent systems lead to the development of several interpretations of process behavior. If we restrict our attention to linear properties only, we can identify three main approaches to trace and testing semantics: the trace distributions, the trace-by-trace and the extremal probabilities approaches. In this paper, we propose novel notions of behavioral metrics that are based on the three classic approaches above, and that can be used to… 

Figures from this paper

The Theory of Traces for Systems with Nondeterminism, Probability, and Termination
TLDR
It is shown how trace semantics for systems combining nondeterministic and probabilistic choices can be recovered by instantiating a coalgebraic construction known as the generalised powerset construction.
The Theory of Traces for Systems with Nondeterminism and Probability
TLDR
It is shown how trace semantics for systems combining nondeterministic and probabilistic choices can be recovered by instantiating a coalgebraic construction known as the generalised powerset construction.
Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics
TLDR
Three specification formats are defined for the bisimilarity metric, one for each continuity property, namely sets of syntactic constraints over the SOS rules defining process operators that guarantee the desired continuity property of the metric.
Symbolic protocol verification with dice: process equivalences in the presence of probabilities
TLDR
This paper shows the need for randomized schedulers and exhibit a counter-example to a result in a previous work that relied on non-randomized ones, and shows that a probabilistic adversary has a strictly superior distinguishing power for may testing, which, when the number of sessions is bounded, shows to coincide with purely possibilistic similarity.
Monads and Quantitative Equational Theories for Nondeterminism and Probability
TLDR
The main result is the presentation of this lifted monad in terms of the quantitative equational theory of convex semilattices, using the framework of quantitative algebras recently introduced by Mardare, Panangaden and Plotkin.

References

SHOWING 1-10 OF 29 REFERENCES
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
TLDR
This paper discusses in full details the new equivalences and provides a simple spectrum that relates them with existing ones in the setting of nondeterministic and probabilistic processes.
Logical Characterization of Trace Metrics
TLDR
This paper provides a characterization of both strong and weak trace metric on nondeterministic probabilistic processes, based on a minimal boolean logic L which it is proved to be powerful enough to characterize strong andWeak Probabilistic trace equivalence.
Probabilistic may/must testing: retaining probabilities by restricted schedulers
TLDR
This paper proposes a new testing theory, aiming at preserving the probability information in a parallel context, and observes that the underlying testing equivalence is too strong and distinguishes between processes that are observationally equivalent.
A Compositional Trace-Based Semantics for Probabilistic Automata
TLDR
The trace semantics for labeled transition systems is extended to a randomized model of concurrent computation and a notion of a probabilistic forward simulation is introduced and it is proved that it is sound for the trace distribution precongruence.
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes
TLDR
By the decomposition of modal formulae on processes with nondeterminism and probability with respect to Structural Operational Semantics, formats for probabilistic bisimilarity, ready similarity and similarity are obtained.
The Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes
TLDR
A spectrum of trace-based, testing, and bisimulation equivalences for nondeterministic and probabilistic processes whose activities are all observable is presented and it is shown that the first approach ‐ which compares two resolutions relatively to the probability distributions of all considered events ‐ results in a fragment of the spectrum compatible with the spectrum of behavioral equivalence for fully probabilism processes.
Logical Characterization of Bisimulation Metrics
TLDR
This paper proposes a logical characterization of bisimulation metrics based on a simple probabilistic variant of the Hennessy-Milner logic and shows that the distance between two processes equals the Distance between their own mimicking formulae.
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
TLDR
It is shown that, unlike nondeterministic transition systems, “maximality” of traces and failures does not increase the distinguishing power of trace and failure equivalence, respectively.
Linear and Branching System Metrics
We extend the classical system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but
...
...