Testing preorders for probabilistic processes

DOI10.1007/3-540-55719-9_116zbMath1425.68289OpenAlexW1543526731MaRDI QIDQ5204359

Amy E. Zwarico, Rance Cleaveland, Scott A. Smolka

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_116

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 (14)

Metrics for labelled Markov processes ⋮ Probabilistic bisimilarity as testing equivalence ⋮ Probabilistic concurrent constraint programming ⋮ Approximating labelled Markov processes ⋮ Deciding bisimilarity and similarity for probabilistic processes. ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Measuring the confinement of probabilistic systems ⋮ Bisimulation for labelled Markov processes ⋮ Non Expansive ε-Bisimulations ⋮ Measure and probability for concurrency theorists ⋮ Testing preorders for probabilistic processes. ⋮ Remarks on Testing Probabilistic Processes ⋮ Notes on Generative Probabilistic Bisimulation ⋮ Additive models of probabilistic processes

Cites Work

• Extensional equivalences for transition systems
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Testing equivalences for processes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing preorders for probabilistic processes