The following pages link to (Q3519383):
Displaying 15 items.
- Combining shared-coin algorithms (Q666060) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states (Q2252526) (← links)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems (Q2272986) (← links)
- Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems (Q2864370) (← links)
- The compositional construction of Markov processes II (Q3006162) (← links)
- Testing Finitary Probabilistic Processes (Q3184679) (← links)
- Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) (Q5739351) (← links)
- Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)
