Testing Finitary Probabilistic Processes

DOI10.1007/978-3-642-04081-8_19MaRDI QIDQ3184679zbMATH OpenOpenAlexFDO

Authors Yuxin Deng, Rob van Glabbeek, Matthew 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)

Recommendations

• Characterising Testing Preorders for Finite Probabilistic Processes
• Remarks on testing probabilistic processes
• Testing preorders for probabilistic processes.
• Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
• Testing preorders for probabilistic processes

Cites work

• Abstraction, Refinement and Proof for Probabilistic Systems
• Characterising Testing Preorders for Finite Probabilistic Processes
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1927573 (Why is no real title available?)
• scientific article; zbMATH DE number 3227750 (Why is no real title available?)
• Observing branching structure through probabilistic contexts
• Remarks on testing probabilistic processes
• Scalar Outcomes Suffice for Finitary Probabilistic Testing
• Testing equivalences for processes
• Testing Finitary Probabilistic Processes

Cited in

(41)

• Testing preorders for probabilistic processes can be characterized by simulations
• Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
• Quantitative analysis of software approximate correctness
• Probabilistic bisimulation for realistic schedulers
• Probabilistic bisimilarity as testing equivalence
• 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
• On the probabilistic bisimulation spectrum with silent moves
• Stuttering for abstract probabilistic automata
• Real-reward testing for probabilistic processes
• Semi-decidability of may, must and probabilistic testing in a higher-type setting
• Probabilistic model of software approximate correctness
• Remarks on testing probabilistic processes
• On the semantics of Markov automata
• Testing Finitary Probabilistic Processes
• Characterising Testing Preorders for Finite Probabilistic Processes
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• On real reward testing
• scientific article; zbMATH DE number 1760049 (Why is no real title available?)
• Termination in convex sets of distributions
• The infinite evolution mechanism of \(\epsilon\)-bisimilarity
• Real-reward testing for probabilistic processes (extended abstract)
• Bisimulations for probabilistic and quantum processes (invited paper)
• Probabilistic Analysis of Binary Sessions
• The theory of traces for systems with nondeterminism, probability, and termination
• scientific article; zbMATH DE number 7204940 (Why is no real title available?)
• Predicatively unprovable termination of the Ackermannian Goodstein process
• Distribution bisimilarity via the power of convex algebras
• Probabilistic bisimulation for realistic schedulers
• A semantics for every GSPN
• Scalar Outcomes Suffice for Finitary Probabilistic Testing
• On divergence-sensitive weak probabilistic bisimilarity
• Reconciling quantum theory and process equivalence via physically admissible schedulers
• A cancellation law for probabilistic processes
• Convex language semantics for nondeterministic probabilistic automata
• A unifying approach to probabilistic testing equivalences
• Finitely dependent processes are finitary
• Fair testing
• Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)

This page was built for publication: Testing Finitary Probabilistic Processes

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