Probabilistic may/must testing: retaining probabilities by restricted schedulers
type: Item
instance of: scholarly article
title: Probabilistic may/must testing: retaining probabilities by restricted schedulers
zbMATH Open document ID: 1259.68152
author: Sonja Georgievska
author: S. Andova
published in: Formal Aspects of Computing
publication date: 2013-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 6148348
zbMATH Keywords: probabilistic may/must testing
zbMATH Keywords: restricted schedulers
zbMATH Keywords: ready-trace equivalence
MaRDI profile type: Publication
full work available at URL: s00165-012-0236-5
OpenAlex ID: W2010586473
cites work: Safe Equivalences for Security Properties
cites work: Information hiding in probabilistic concurrent systems
cites work: Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
cites work: Q3404131
cites work: Model checking of probabilistic and nondeterministic systems
cites work: A Theory of Communicating Sequential Processes
cites work: Algebraic theory of probabilistic and nondeterministic processes.
cites work: Making Random Choices Invisible to the Scheduler
cites work: Switched PIOA: parallel composition via distributed scheduling
cites work: A testing scenario for probabilistic processes
cites work: Q4791844
cites work: Testing equivalences for processes
cites work: Testing Finitary Probabilistic Processes
cites work: Characterising Testing Preorders for Finite Probabilistic Processes
cites work: Q5822308
cites work: EQUIVALENCE OF LABELED MARKOV CHAINS
cites work: Retaining the Probabilities in Probabilistic Testing Theory
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Branching Bisimilarity with Explicit Divergence
cites work: Q3997501
cites work: Q3777424
cites work: Q5635253
cites work: Testing preorders for probabilistic processes can be characterized by simulations
cites work: Planning and acting in partially observable stochastic domains
cites work: Bisimulation through probabilistic testing
cites work: Q3868589
cites work: Specification, testing and implementation relations for symbolic-probabilistic systems
cites work: Q3519383
cites work: Abstraction, Refinement and Proof for Probabilistic Systems
cites work: A calculus of communicating systems
cites work: Refinement-oriented probability for CSP
cites work: Extensional equivalences for transition systems
cites work: Q3694687
cites work: Q4315289
cites work: Fair testing
cites work: Probabilistic communicating processes
cites work: Q4370247
cites work: Composition and behaviors of probabilistic I/O automata
DOI: 10.1007/S00165-012-0236-5
description: scientific article; zbMATH DE number 6148348