revised version

ACV-abstract-2026/references.bib

@@ -6242,7 +6242,7 @@
 }
 
 @article{Dubut25,
-  title={Aczel-mendler bisimulations in a regular category},
+  title={{Aczel-Mendler} bisimulations in a regular category},
   author={Dubut, J{\'e}r{\'e}my},
   journal={Logical Methods in Computer Science},
   volume={21},
@@ -6250,3 +6250,28 @@
   publisher={Episciences. org}
 }
 
+@Article{HJ04,
+  author   = {Hughes, Jesse and Jacobs, Bart},
+  title    = {Simulations in coalgebra},
+  journal  = {Theoretical Computer Science},
+  year     = 2004,
+  volume   = 327,
+  number   = 1,
+  pages    = {71--108},
+  month    = oct,
+  abstract = {A new approach to simulations is proposed within the theory of coalgebras by taking a notion of order on a functor as primitive. Such an order forms a basic building block for a
+ “lax relation lifting”, or “relator” as used by other authors. Simulations appear as coalgebras of this lifted functor, and similarity as greatest simulation. Two-way similarity is then simi
+larity in both directions. In general, it is different from bisimilarity (in the usual coalgebraic sense), but a sufficient condition is formulated (and illustrated) to ensure that bisimilari
+ty and two-way similarity coincide. Also, suitable conditions are identified which ensures that similarity on a final coalgebra forms an (algebraic) dcpo structure. This involves a close inve
+stigation of the iterated applications Fn(∅) and Fn(1) of a functor F with an order to the initial algebras and final objects.},
+  doi      = {10.1016/j.tcs.2004.07.022},
+  file     = {Full Text PDF:HJ04_Simulations_in_coalgebra.pdf:PDF},
+  issn     = {0304-3975},
+  keywords = {Coalgebra, Relation lifting, Simulation},
+  series   = {Selected {Papers} of {CMCS} '03},
+  url      = {http://www.sciencedirect.com/science/article/pii/S030439750400444X},
+  urldate  = {2017-11-13},
+}
+
+
+