Pages that link to "Item:Q5164166"
From MaRDI portal
The following pages link to An O(m log n) algorithm for branching bisimilarity on labelled transition systems (Q5164166):
Displaying 8 items.
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- (Q5089272) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)
- Apartness and distinguishing formulas in Hennessy-Milner logic (Q6163888) (← links)
- Branching bisimulation semantics enables noninterference analysis of reversible systems (Q6535463) (← links)
- CRYSTAL framework: cybersecurity assurance for cyber-physical systems (Q6561338) (← links)
- Compositional verification of priority systems using sharp bisimulation (Q6564171) (← links)