Retaining the Probabilities in Probabilistic Testing Theory

DOI10.1007/978-3-642-12032-9_7zbMath1284.68397OpenAlexW1497421547MaRDI QIDQ3557845

Sonja Georgievska, Suzana Andova

Publication date: 27 April 2010

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12032-9_7

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Reconciling real and stochastic time: the need for probabilistic refinement ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms ⋮ Probabilistic rely-guarantee calculus ⋮ Relating strong behavioral equivalences for processes with nondeterminism and probabilities

This page was built for publication: Retaining the Probabilities in Probabilistic Testing Theory