Testing Finitary Probabilistic Processes

DOI10.1007/978-3-642-04081-8_19zbMath1254.68166OpenAlexW2012095234MaRDI QIDQ3184679

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

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_19

Mathematics Subject Classification ID

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 (25)

Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours ⋮ A Semantics for Every GSPN ⋮ Testing Finitary Probabilistic Processes ⋮ Quantitative analysis of software approximate correctness ⋮ Probabilistic bisimulation for realistic schedulers ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Probabilistic bisimilarity as testing equivalence ⋮ On the probabilistic bisimulation spectrum with silent moves ⋮ On divergence-sensitive weak probabilistic bisimilarity ⋮ 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 ⋮ Exploring probabilistic bisimulations. I ⋮ Unnamed Item ⋮ Stuttering for abstract probabilistic automata ⋮ The infinite evolution mechanism of \(\epsilon\)-bisimilarity ⋮ Real-reward testing for probabilistic processes ⋮ On the Semantics of Markov Automata ⋮ Unnamed Item ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ Unnamed Item ⋮ Termination in Convex Sets of Distributions ⋮ Probabilistic Analysis of Binary Sessions ⋮ Probabilistic model of software approximate correctness ⋮ Unnamed Item

Cites Work

• Testing equivalences for processes
• Remarks on Testing Probabilistic Processes
• Testing Finitary Probabilistic Processes
• Characterising Testing Preorders for Finite Probabilistic Processes
• Abstraction, Refinement and Proof for Probabilistic Systems
• Scalar Outcomes Suffice for Finitary Probabilistic Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing Finitary Probabilistic Processes