Remarks on Testing Probabilistic Processes

DOI10.1016/j.entcs.2007.02.013zbMath1277.68121OpenAlexW2039139411MaRDI QIDQ2864156

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

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

simulationstructural operational semanticsCSPtransition systemsnondeterminismtesting equivalencesprobabilistic processescomplete axiomatisations

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) 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 (11)

Unifying Theories of Programming with Monads ⋮ Testing Finitary Probabilistic Processes ⋮ SOS specifications for uniformly continuous operators ⋮ On real reward testing ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ Real-reward testing for probabilistic processes ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Probabilistic Analysis of Binary Sessions ⋮ Probabilistic Barbed Congruence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Retracted: Semantic domains for combining probability and non-determinism
• Probabilistic and prioritized models of timed CSP
• Specification-oriented semantics for communicating processes
• Bisimulation through probabilistic testing
• The Vienna development method: The meta-language
• Testing equivalences for processes
• Probabilistic models for the guarded command language
• Algebraic theory of probabilistic and nondeterministic processes.
• Testing preorders for probabilistic processes can be characterized by simulations
• A structural approach to operational semantics
• Refinement-oriented probability for CSP
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Finite state Markovian decision processes
• A Theory of Communicating Sequential Processes
• Branching time and abstraction in bisimulation semantics
• Testing preorders for probabilistic processes
• Distributing probability over non-determinism
• Probabilistic automata
• Random-Access Stored-Program Machines, an Approach to Programming Languages
• Foundations of Software Science and Computational Structures
• The Mechanical Evaluation of Expressions
• A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Partial correctness for probabilistic demonic programs
• Testing probabilistic automata

This page was built for publication: Remarks on Testing Probabilistic Processes