Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Safe Equivalences for Security Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information hiding in probabilistic concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3404131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic theory of probabilistic and nondeterministic processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Random Choices Invisible to the Scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switched PIOA: parallel composition via distributed scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A testing scenario for probabilistic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing equivalences for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Finitary Probabilistic Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising Testing Preorders for Finite Probabilistic Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5822308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EQUIVALENCE OF LABELED MARKOV CHAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retaining the Probabilities in Probabilistic Testing Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Bisimilarity with Explicit Divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5635253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing preorders for probabilistic processes can be characterized by simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and acting in partially observable stochastic domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification, testing and implementation relations for symbolic-probabilistic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3519383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction, Refinement and Proof for Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinement-oriented probability for CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensional equivalences for transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic communicating processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition and behaviors of probabilistic I/O automata / rank
 
Normal rank

Latest revision as of 08:05, 6 July 2024

scientific article
Language Label Description Also known as
English
Probabilistic may/must testing: retaining probabilities by restricted schedulers
scientific article

    Statements

    Probabilistic may/must testing: retaining probabilities by restricted schedulers (English)
    0 references
    0 references
    0 references
    22 March 2013
    0 references
    0 references
    probabilistic may/must testing
    0 references
    restricted schedulers
    0 references
    ready-trace equivalence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references