Pages that link to "Item:Q5756588"
From MaRDI portal
The following pages link to Probability and Nondeterminism in Operational Models of Concurrency (Q5756588):
Displayed 17 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Abstract probabilistic automata (Q386011) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Weak bisimulation is sound and complete for pCTL\(^*\) (Q2266992) (← links)
- Stuttering for abstract probabilistic automata (Q2436515) (← links)
- Least upper bounds for probability measures and their applications to abstractions (Q2637319) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- Refinement Sensitive Formal Semantics of State Machines With Persistent Choice (Q2810972) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra (Q3005988) (← links)
- Abstract Probabilistic Automata (Q3075492) (← links)
- Weighted versus Probabilistic Logics (Q3637211) (← links)
- (Q5028476) (← links)
- Specification Theories for Probabilistic and Real-Time Systems (Q5170746) (← links)
- Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism (Q6201390) (← links)