The following pages link to (Q4536612):
Displayed 36 items.
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Finite axiomatization for symbolic probabilistic \(\pi \)-calculus (Q615236) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
- Exploring probabilistic bisimulations. I (Q1941884) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- A probabilistic calculus of cyber-physical systems (Q2042728) (← links)
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities (Q2253178) (← links)
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes (Q2257984) (← links)
- Weak bisimulation is sound and complete for pCTL\(^*\) (Q2266992) (← links)
- Resources in process algebra (Q2373652) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Stuttering for abstract probabilistic automata (Q2436515) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations (Q2830042) (← links)
- Remarks on Testing Probabilistic Processes (Q2864156) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- On the Semantics of Markov Automata (Q3012929) (← links)
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
- (Q4558784) (← links)
- Probabilistic Bisimulation for Realistic Schedulers (Q5206954) (← links)
- A Family of Resource-Bound Real-Time Process Algebras (Q5262969) (← links)
- Branching Bisimulation Congruence for Probabilistic Systems (Q5415667) (← links)
- Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) (Q5739351) (← links)