Pages that link to "Item:Q2957519"
From MaRDI portal
The following pages link to Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time (Q2957519):
Displaying 4 items.
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours (Q1633345) (← links)
- Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states (Q2252526) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
