Real-reward testing for probabilistic processes
From MaRDI portal
Publication:2453107
DOI10.1016/j.tcs.2013.07.016zbMath1359.68218arXiv1107.1201OpenAlexW2062879889MaRDI QIDQ2453107
Carroll Morgan, Yu-xin Deng, Matthew C. B. Hennessy, Robert J. van Glabbeek
Publication date: 6 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1201
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic PDL
- Testing equivalences for processes
- Remarks on Testing Probabilistic Processes
- Testing Finitary Probabilistic Processes
- Characterising Testing Preorders for Finite Probabilistic Processes
- Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
- Scalar Outcomes Suffice for Finitary Probabilistic Testing
- Testing probabilistic automata