The following pages link to (Q4484499):
Displayed 21 items.
- 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)
- Abstract probabilistic automata (Q386011) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states (Q2252526) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- An Algorithm for Probabilistic Alternating Simulation (Q2891387) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- Abstract Probabilistic Automata (Q3075492) (← links)
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
- Deciding Simulations on Probabilistic Automata (Q3510797) (← links)
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
- Specification Theories for Probabilistic and Real-Time Systems (Q5170746) (← links)
- Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) (Q5739351) (← links)