Remarks on testing probabilistic processes

DOI10.1016/J.ENTCS.2007.02.013MaRDI QIDQ2864156zbMATH OpenOpenAlexFDO

Authors Yuxin Deng, Chenyi Zhang, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan

Publication date 6 December 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2007.02.013

zbMATH Keywords

simulationCSPnondeterminismtransition systemstesting equivalencesstructural operational semanticsprobabilistic processescomplete axiomatisations

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Algebraic theory of probabilistic processes.
• Testing Finitary Probabilistic Processes
• A testing scenario for probabilistic processes
• Testing preorders for probabilistic processes.
• Retaining the probabilities in probabilistic testing theory

Cites work

• scientific article; zbMATH DE number 1701760 (Why is no real title available?)
• scientific article; zbMATH DE number 4179422 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3765109 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 1231682 (Why is no real title available?)
• scientific article; zbMATH DE number 1754605 (Why is no real title available?)
• scientific article; zbMATH DE number 1759621 (Why is no real title available?)
• scientific article; zbMATH DE number 1759622 (Why is no real title available?)
• scientific article; zbMATH DE number 783754 (Why is no real title available?)
• scientific article; zbMATH DE number 3386890 (Why is no real title available?)
• A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
• A Theory of Communicating Sequential Processes
• A structural approach to operational semantics
• Algebraic theory of probabilistic and nondeterministic processes.
• Axioms for probability and nondeterminism
• Bisimulation through probabilistic testing
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Branching time and abstraction in bisimulation semantics
• Distributing probability over non-determinism
• Finite state Markovian decision processes
• Foundations of Software Science and Computational Structures
• Partial correctness for probabilistic demonic programs
• Probabilistic and prioritized models of timed CSP
• Probabilistic automata
• Probabilistic extensions of process algebras.
• Probabilistic models for the guarded command language
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Random-Access Stored-Program Machines, an Approach to Programming Languages
• Refinement-oriented probability for CSP
• Retracted: Semantic domains for combining probability and non-determinism
• Specification-oriented semantics for communicating processes
• Testing equivalences for processes
• Testing preorders for probabilistic processes
• Testing preorders for probabilistic processes can be characterized by simulations
• Testing probabilistic automata
• The Mechanical Evaluation of Expressions
• The Vienna development method: The meta-language

Cited in

(33)

• Probabilistic divide \& congruence: branching bisimilarity
• Probabilistic Analysis of Binary Sessions
• Scalar Outcomes Suffice for Finitary Probabilistic Testing
• On real reward testing
• Semi-decidability of may, must and probabilistic testing in a higher-type setting
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Back to the format: a survey on SOS for probabilistic processes
• Testing preorders for probabilistic processes.
• Testing preorders for probabilistic processes
• Testing preorders for probabilistic processes can be characterized by simulations
• scientific article; zbMATH DE number 1863172 (Why is no real title available?)
• SOS specifications for uniformly continuous operators
• Real-reward testing for probabilistic processes (extended abstract)
• Retaining the probabilities in probabilistic testing theory
• scientific article; zbMATH DE number 7311343 (Why is no real title available?)
• Bisimulation through probabilistic testing
• scientific article; zbMATH DE number 1191245 (Why is no real title available?)
• Unifying theories of programming with monads
• Real-reward testing for probabilistic processes
• Testing theories for broadcasting processes
• A unifying approach to probabilistic testing equivalences
• A model of probabilistic processes
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• A testing scenario for probabilistic processes
• Testing Finitary Probabilistic Processes
• Reward testing equivalences for processes
• Characterising Testing Preorders for Finite Probabilistic Processes
• Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
• Formalisation of Probabilistic Testing Semantics in Coq
• Process behaviour: formulae vs. tests (extended abstract)
• Probabilistic barbed congruence
• scientific article; zbMATH DE number 1418454 (Why is no real title available?)
• Algebraic theory of probabilistic processes.

This page was built for publication: Remarks on testing probabilistic processes

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