Remarks on Testing Probabilistic Processes
DOI10.1016/j.entcs.2007.02.013zbMath1277.68121MaRDI 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
simulation; structural operational semantics; CSP; transition systems; nondeterminism; testing equivalences; probabilistic processes; complete axiomatisations
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Cites Work
- 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
- 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