Probabilistic may/must testing: retaining probabilities by restricted schedulers

DOI10.1007/S00165-012-0236-5zbMATH Open1259.68152OpenAlexW2010586473MaRDI QIDQ1941883FDOQ1941883

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

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

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)

Cites Work

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

Cited In (8)

• Probabilistic Analysis of Binary Sessions
• The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
• Semi-decidability of may, must and probabilistic testing in a higher-type setting
• Retaining the probabilities in probabilistic testing theory
• Using schedulers to test probabilistic distributed systems
• Reconciling real and stochastic time: the need for probabilistic refinement
• Title not available (Why is that?)
• 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)