The following pages link to (Q2769588):
Displaying 16 items.
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi (Q481103) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Algebraic theory of probabilistic processes. (Q1400293) (← links)
- A process algebra for probabilistic and nondeterministic processes (Q1607111) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Exploring probabilistic bisimulations. I (Q1941884) (← links)
- Probabilistic process algebra to unifying quantum and classical computing in closed systems (Q2010969) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- Remarks on Testing Probabilistic Processes (Q2864156) (← links)
- Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
