Pages that link to "Item:Q2633253"
From MaRDI portal
The following pages link to An efficient algorithm to determine probabilistic bisimulation (Q2633253):
Displaying 10 items.
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- An implementation of an efficient algorithm for bisimulation equivalence (Q922711) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- (Q4484499) (← links)
- (Q5089272) (← links)
- (Q5214815) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)
- Explicit Hopcroft's trick in categorical partition refinement (Q6666777) (← links)