A testing scenario for probabilistic processes

DOI10.1145/1314690.1314693zbMath1326.68138OpenAlexW2163369706MaRDI QIDQ3546349

Ling Cheung, Mariëlle I. A. Stoelinga, Frits W. Vaandrager

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/35234

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (16)

Statistical Model Checking for Variability-Intensive Systems ⋮ Switched PIOA: parallel composition via distributed scheduling ⋮ Testing probabilistic equivalence through reinforcement learning ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Abstract probabilistic automata ⋮ Determining asynchronous test equivalence for probabilistic processes ⋮ A reconstruction of Ewens' sampling formula via lists of coins ⋮ Reconciling real and stochastic time: the need for probabilistic refinement ⋮ 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 ⋮ Polynomial time decision algorithms for probabilistic automata ⋮ Model-based testing of probabilistic systems ⋮ Specification Theories for Probabilistic and Real-Time Systems ⋮ Testing from a stochastic timed system with a fault model ⋮ Abstract Probabilistic Automata

This page was built for publication: A testing scenario for probabilistic processes