Pages that link to "Item:Q1941884"
From MaRDI portal
The following pages link to Exploring probabilistic bisimulations. I (Q1941884):
Displaying 17 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Differential privacy in probabilistic systems (Q529047) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- Approximate analyzing of labeled transition systems (Q1667079) (← links)
- Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
- Probabilistic bisimilarity as testing equivalence (Q1680507) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies (Q2134814) (← links)
- On the probabilistic bisimulation spectrum with silent moves (Q2182668) (← links)
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes (Q2257984) (← links)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems (Q2272986) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations (Q2830042) (← links)
- Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions (Q2946748) (← links)
- (Q5009413) (← links)
- (Q5111636) (← links)
- Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)