Pages that link to "Item:Q1975973"
From MaRDI portal
The following pages link to Deciding bisimilarity and similarity for probabilistic processes. (Q1975973):
Displayed 8 items.
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Bisimulation relations for weighted automata (Q2481957) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- Weighted Bisimulation in Linear Algebraic Form (Q3184672) (← links)
- Deciding Simulations on Probabilistic Automata (Q3510797) (← links)
- A Space-Efficient Probabilistic Simulation Algorithm (Q3541022) (← links)