Search

• < Previous
• 1
• Next >

---

Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically

Diego Latella ; Mieke Massink ; Erik P De Vink.

Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which relate states to functions of states over general semirings, equipped with a rich set of higher-order operators. As such, FuTS constitute a convenient modeling instrument to deal with process&nbsp;[&hellip;]

---

Lowerbounds for Bisimulation by Partition Refinement

Jan Friso Groote ; Jan Martens ; Erik. P. de Vink.

We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For sequential algorithms this is $\Omega((m \mkern1mu {+} \mkern1mu n ) \mkern-1mu \log \mkern-1mu n)$ and for parallel algorithms this is&nbsp;[&hellip;]

---