Pages that link to "Item:Q672230"
From MaRDI portal
The following pages link to Probabilistic communicating processes (Q672230):
Displayed 14 items.
- Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language (Q652158) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- Additive models of probabilistic processes (Q1607220) (← links)
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics (Q1683708) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q1960528) (← links)
- Stepwise refinement of sequence diagrams with soft real-time constraints (Q2353401) (← links)
- Refinement-oriented probability for CSP (Q2365393) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice (Q4923369) (← links)
- A logical approach to multilevel security of probabilistic systems (Q5137350) (← links)