Pages that link to "Item:Q5278211"
From MaRDI portal
The following pages link to An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211):
Displaying 16 items.
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- Parity game reductions (Q1656552) (← links)
- Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Cartesian difference categories (Q2200813) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications (Q2665348) (← links)
- (Q5020941) (← links)
- Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types (Q5041094) (← links)
- Geometric Model Checking of Continuous Space (Q5060193) (← links)
- (Q5089272) (← links)
- (Q5155676) (← links)
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems (Q5164166) (← links)
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities (Q5164168) (← links)
- (Q5214815) (← links)
- (Q5856411) (← links)
