Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism
From MaRDI portal
Publication:2056980
DOI10.1007/978-3-030-59854-9_5zbMATH Open1483.68224OpenAlexW3097712492MaRDI QIDQ2056980FDOQ2056980
Authors: Marco Bernardo
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-59854-9_5
Recommendations
- Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
- Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- The spectrum of strong behavioral equivalences for nondeterministic and probabilistic processes
- (In)finite trace equivalence of probabilistic transition systems
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (8)
- Towards general axiomatizations for bisimilarity and trace semantics
- Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
- The spectrum of strong behavioral equivalences for nondeterministic and probabilistic processes
- Title not available (Why is that?)
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Determining asynchronous test equivalence for probabilistic processes
- THREE CHARACTERIZATIONS OF STRICT COHERENCE ON INFINITE-VALUED EVENTS
- A Complete Axiomatisation for Probabilistic Trace Equivalence
This page was built for publication: Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056980)