Pages that link to "Item:Q2266992"
From MaRDI portal
The following pages link to Weak bisimulation is sound and complete for pCTL\(^*\) (Q2266992):
Displayed 10 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
- On the probabilistic bisimulation spectrum with silent moves (Q2182668) (← links)
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes (Q2257984) (← links)
- A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
- A General Framework for Probabilistic Characterizing Formulae (Q2891432) (← links)
- On the Semantics of Markov Automata (Q3012929) (← links)
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
- Probabilistic Bisimulation for Realistic Schedulers (Q5206954) (← links)
- A Semantics for Every GSPN (Q5300867) (← links)