Pages that link to "Item:Q3584919"
From MaRDI portal
The following pages link to Concurrency and Composition in a Stochastic World (Q3584919):
Displayed 15 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Confluence reduction for Markov automata (Q507382) (← links)
- Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
- The quest for minimal quotients for probabilistic and Markov automata (Q1784955) (← links)
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies (Q2134814) (← links)
- Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states (Q2252526) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- (Q5111636) (← links)
- (Q5155671) (← links)
- Probabilistic Bisimulation for Realistic Schedulers (Q5206954) (← links)
- A Semantics for Every GSPN (Q5300867) (← links)
- Equivalence checking 40 years after: a review of bisimulation tools (Q6163887) (← links)