Probabilistic may/must testing: retaining probabilities by restricted schedulers

DOI10.1007/S00165-012-0236-5MaRDI QIDQ1941883zbMATH OpenOpenAlexFDO

Authors Sonja Georgievska, S. Andova

Publication date 22 March 2013

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-012-0236-5

zbMATH Keywords

probabilistic may/must testingready-trace equivalencerestricted schedulers

Mathematics Subject Classification ID

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

Recommendations

• Retaining the probabilities in probabilistic testing theory
• Remarks on testing probabilistic processes
• Testing Finitary Probabilistic Processes
• scientific article; zbMATH DE number 7311343
• Publication:4942011

Cites work

• scientific article; zbMATH DE number 3919813 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3671478 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1104373 (Why is no real title available?)
• scientific article; zbMATH DE number 1863173 (Why is no real title available?)
• scientific article; zbMATH DE number 3361678 (Why is no real title available?)
• scientific article; zbMATH DE number 3085434 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A calculus of communicating systems
• A testing scenario for probabilistic processes
• Abstraction, Refinement and Proof for Probabilistic Systems
• Algebraic theory of probabilistic and nondeterministic processes.
• Bisimulation through probabilistic testing
• Branching Bisimilarity with Explicit Divergence
• Characterising Testing Preorders for Finite Probabilistic Processes
• Composition and behaviors of probabilistic I/O automata
• EQUIVALENCE OF LABELED MARKOV CHAINS
• Extensional equivalences for transition systems
• Fair testing
• Information hiding in probabilistic concurrent systems
• Making Random Choices Invisible to the Scheduler
• Model checking of probabilistic and nondeterministic systems
• Observing branching structure through probabilistic contexts
• Planning and acting in partially observable stochastic domains
• Probabilistic communicating processes
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• Refinement-oriented probability for CSP
• Retaining the probabilities in probabilistic testing theory
• Safe equivalences for security properties
• Specification, testing and implementation relations for symbolic-probabilistic systems
• Switched PIOA: parallel composition via distributed scheduling
• Testing Finitary Probabilistic Processes
• Testing equivalences for processes
• Testing preorders for probabilistic processes can be characterized by simulations
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.

Cited in

(8)

• scientific article; zbMATH DE number 7447772 (Why is no real title available?)
• Semi-decidability of may, must and probabilistic testing in a higher-type setting
• The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
• Probabilistic Analysis of Binary Sessions
• Retaining the probabilities in probabilistic testing theory
• Reconciling real and stochastic time: the need for probabilistic refinement
• Using schedulers to test probabilistic distributed systems
• Probabilistic rely-guarantee calculus

This page was built for publication: Probabilistic may/must testing: retaining probabilities by restricted schedulers

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