The following pages link to (Q4535031):
Displaying 42 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Finite axiomatization for symbolic probabilistic \(\pi \)-calculus (Q615236) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes (Q974113) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- Hiding resources that can fail: An axiomatic perspective (Q1607106) (← links)
- Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours (Q1633345) (← links)
- Axiomatizing probabilistic processes: ACP with generative probabilities (Q1899914) (← links)
- Exploring probabilistic bisimulations. I (Q1941884) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q1960528) (← links)
- Complete axiomatization for the total variation distance of Markov chains (Q2130580) (← links)
- A complete axiomatization of weighted branching bisimulation (Q2182679) (← links)
- Towards general axiomatizations for bisimilarity and trace semantics (Q2237336) (← links)
- Weak bisimulation is sound and complete for pCTL\(^*\) (Q2266992) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- Environmental bisimulations for probabilistic higher-order languages (Q2828300) (← links)
- Remarks on testing probabilistic processes (Q2864156) (← links)
- Notes on generative probabilistic bisimulation (Q2866317) (← links)
- Probabilistic barbed congruence (Q2870293) (← links)
- Probabilistic bisimulation as a congruence (Q2946567) (← links)
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi (Q2974795) (← links)
- (Q3023541) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- Probabilistic Bisimulation: Naturally on Distributions (Q3190122) (← links)
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
- (Q4508289) (← links)
- (Q4536612) (← links)
- (Q4558787) (← links)
- Bisimulations, logics, and trace distributions for stochastic systems with rewards (Q4561429) (← links)
- Two axiomatic approaches to the probabilistic serial mechanism (Q4586003) (← links)
- Convexity via Weak Distributive Laws (Q5060194) (← links)
- Monads and Quantitative Equational Theories for Nondeterminism and Probability (Q5089294) (← links)
- A Complete Axiomatisation for Probabilistic Trace Equivalence (Q5089615) (← links)
- Non Expansive ε-Bisimulations (Q5505435) (← links)
- Foundations of Software Science and Computational Structures (Q5705912) (← links)
- Sound approximate and asymptotic probabilistic bisimulations for PCTL (Q6135748) (← links)
- Uniform random process model revisited (Q6536319) (← links)
