Pages that link to "Item:Q1975973"
From MaRDI portal
The following pages link to Deciding bisimilarity and similarity for probabilistic processes. (Q1975973):
Displayed 20 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- Exploring probabilistic bisimulations. I (Q1941884) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Bisimulation relations for weighted automata (Q2481957) (← links)
- An Algorithm for Probabilistic Alternating Simulation (Q2891387) (← links)
- A General Framework for Probabilistic Characterizing Formulae (Q2891432) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- Differential Bisimulation for a Markovian Process Algebra (Q2946344) (← links)
- Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation (Q3012928) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
- Weighted Bisimulation in Linear Algebraic Form (Q3184672) (← links)
- Deciding Simulations on Probabilistic Automata (Q3510797) (← links)
- A Space-Efficient Probabilistic Simulation Algorithm (Q3541022) (← links)
- Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)