Pages that link to "Item:Q2842853"
From MaRDI portal
The following pages link to A distributed algorithm for strong bisimulation reduction of state spaces (Q2842853):
Displaying 13 items.
- Computing maximal weak and other bisimulations (Q510897) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Cartesian difference categories (Q2200813) (← links)
- Distributed branching bisimulation reduction of state spaces (Q2845494) (← links)
- A state space distribution policy based on abstract interpretation (Q2848146) (← links)
- A Database Approach to Distributed State-Space Generation (Q3069997) (← links)
- Application of bipartite graphs for achieving race-free state assignments (Q4421202) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities (Q5164168) (← links)
- (Q5214815) (← links)
- Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking (Q5415660) (← links)
- Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis (Q6535518) (← links)
- Distributed coalgebraic partition refinement (Q6535613) (← links)