Testing probabilistic automata
From MaRDI portal
Publication:6104379
DOI10.1007/3-540-61604-7_62zbMath1514.68112MaRDI QIDQ6104379
Publication date: 28 June 2023
Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items
Specification, testing and implementation relations for symbolic-probabilistic systems, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Probabilistic bisimilarity as testing equivalence, Determining asynchronous test equivalence for probabilistic processes, Algebraic theory of probabilistic processes., Fair must testing for I/O automata, Real-reward testing for probabilistic processes, Model-based testing of probabilistic systems, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Ensuring liveness properties of distributed systems: open problems, A randomized encoding of the \(\pi\)-calculus with mixed choice, Testing preorders for probabilistic processes., Remarks on Testing Probabilistic Processes
Cites Work