Characterising Testing Preorders for Finite Probabilistic Processes

DOI10.2168/LMCS-4(4:4)2008zbMath1161.68035MaRDI QIDQ3623001

Yu-xin Deng, Carroll Morgan, Robert J. van Glabbeek, Matthew C. B. Hennessy

Publication date: 29 April 2009

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces, A space-efficient simulation algorithm on probabilistic automata, Weighted Bisimulation in Linear Algebraic Form, Testing Finitary Probabilistic Processes, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions, On real reward testing, Back to the format: a survey on SOS for probabilistic processes, Deterministic concurrent strategies, Using schedulers to test probabilistic distributed systems, Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus, Probabilistic may/must testing: retaining probabilities by restricted schedulers, Fair must testing for I/O automata, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Real-reward testing for probabilistic processes, The metric linear-time branching-time spectrum on nondeterministic probabilistic processes, Model-based testing of probabilistic systems, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Probabilistic divide \& congruence: branching bisimilarity, Ensuring liveness properties of distributed systems: open problems, Unnamed Item, Unnamed Item, Unnamed Item, Preface, A probabilistic calculus of cyber-physical systems, Unnamed Item, MarCaSPiS: a Markovian Extension of a Calculus for Services, Termination in Convex Sets of Distributions, A Spectrum of Behavioral Relations over LTSs on Probability Distributions, Semantic Analysis of Gossip Protocols for Wireless Sensor Networks, Constructing weak simulations from linear implications for processes with private names, Compositional weak metrics for group key update, Raiders of the lost equivalence: probabilistic branching bisimilarity, Unnamed Item, Trace semantics via determinization