Probabilistic may/must testing: retaining probabilities by restricted schedulers

DOI10.1007/s00165-012-0236-5zbMath1259.68152OpenAlexW2010586473MaRDI QIDQ1941883

Sonja Georgievska, Suzana 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

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

Reconciling real and stochastic time: the need for probabilistic refinement ⋮ Unnamed Item ⋮ Probabilistic rely-guarantee calculus ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Probabilistic Analysis of Binary Sessions

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
• Planning and acting in partially observable stochastic domains
• Information hiding in probabilistic concurrent systems
• Probabilistic communicating processes
• Switched PIOA: parallel composition via distributed scheduling
• Fair testing
• Extensional equivalences for transition systems
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Testing equivalences for processes
• Composition and behaviors of probabilistic I/O automata
• Algebraic theory of probabilistic and nondeterministic processes.
• Testing preorders for probabilistic processes can be characterized by simulations
• Refinement-oriented probability for CSP
• Specification, testing and implementation relations for symbolic-probabilistic systems
• Model checking of probabilistic and nondeterministic systems
• Safe Equivalences for Security Properties
• Testing Finitary Probabilistic Processes
• Branching Bisimilarity with Explicit Divergence
• Making Random Choices Invisible to the Scheduler
• EQUIVALENCE OF LABELED MARKOV CHAINS
• A testing scenario for probabilistic processes
• Retaining the Probabilities in Probabilistic Testing Theory
• Characterising Testing Preorders for Finite Probabilistic Processes
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• A Theory of Communicating Sequential Processes
• Abstraction, Refinement and Proof for Probabilistic Systems