Retaining the probabilities in probabilistic testing theory

DOI10.1007/978-3-642-12032-9_7MaRDI QIDQ3557845zbMATH OpenOpenAlexFDO

Authors Sonja Georgievska, S. 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)

Recommendations

• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Remarks on testing probabilistic processes
• Algebraic theory of probabilistic processes.
• scientific article; zbMATH DE number 7311343
• Testing preorders for probabilistic processes.

Cited in

(8)

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

This page was built for publication: Retaining the probabilities in probabilistic testing theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557845)