Pages that link to "Item:Q2482725"
From MaRDI portal
The following pages link to Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725):
Displaying 10 items.
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- (in)finite trace equivalence of probabilistic transition systems (Q1798789) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2911645) (← links)
- Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time (Q2957519) (← links)
- Bisimilarity of Probabilistic Pushdown Automata (Q2957520) (← links)
- (Q4270070) (← links)
- (Q4558784) (← links)