Testing preorders for probabilistic processes.
From MaRDI portal
Recommendations
Cites work
- Bisimulation through probabilistic testing
- Composition and behaviors of probabilistic I/O automata
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- scientific article; zbMATH DE number 3982506 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- Reactive, generative, and stratified models of probabilistic processes
- Testing equivalences for processes
- Testing preorders for probabilistic processes
- Testing probabilistic automata
- The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
Cited in
(41)- Testing from a stochastic timed system with a fault model
- Basic observables for processes
- Composition and behaviors of probabilistic I/O automata
- Algebraic theory of probabilistic and nondeterministic processes.
- Algebraic theory of probabilistic processes.
- Testing preorders for probabilistic processes can be characterized by simulations
- Additive models of probabilistic processes
- Using schedulers to test probabilistic distributed systems
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
- Characterization of simulation by probabilistic testing
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Specification, testing and implementation relations for symbolic-probabilistic systems
- Non-bisimulation-based Markovian behavioral equivalences
- Real-reward testing for probabilistic processes
- \(\pi\)-calculus with noisy channels
- Determining asynchronous test equivalence for probabilistic processes
- Characterising testing preorders for broadcasting distributed systems
- Mutually testing processes (extended abstract)
- Remarks on testing probabilistic processes
- Testing Finitary Probabilistic Processes
- Retaining the probabilities in probabilistic testing theory
- Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems
- Characterising Testing Preorders for Finite Probabilistic Processes
- Testing probabilistic equivalence through reinforcement learning
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- scientific article; zbMATH DE number 1538044 (Why is no real title available?)
- scientific article; zbMATH DE number 1759619 (Why is no real title available?)
- scientific article; zbMATH DE number 1372680 (Why is no real title available?)
- Real-reward testing for probabilistic processes (extended abstract)
- Probabilistic Analysis of Binary Sessions
- Testing preorders for probabilistic processes
- Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
- Performance-Oriented Comparison of Web Services Via Client-Specific Testing Preorders
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- Testing probabilistic automata
- Testing processes for efficiency
- Model-based testing of probabilistic systems
- Uniform logical characterizations of testing equivalences for nondeterministic, probabilistic and Markovian processes
- A unifying approach to probabilistic testing equivalences
- Fair testing
- A precongruence format for should testing preorder
This page was built for publication: Testing preorders for probabilistic processes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854314)
