An axiomatics for categories of transition systems as coalgebras

We consider a finitely branching transition system as a coalgebra for an endofunctor on the category Set of small sets. A map in that category is a functional bisimulation. So, we study the structure of the category of finitely branching transition systems and functional bisimulations by proving general results about the category H-Coalg of H-coalgebras for an endofunctor H on Set. We give conditions under which H-Coalg is complete, cocomplete, symmetric monoidal closed, regular, and has a subobject classifier.

[1]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[2]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[3]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[4]  Michael Makkai,et al.  Accessible categories: The foundations of categorical model theory, , 2007 .

[5]  G. M. Kelly,et al.  Structures defined by finite limits in the enriched context, I , 1982 .

[6]  James Worrell.  Toposes of Coalgebras and Hidden Algebras , 1998, CMCS.

[7]  A. R. D. Mathias,et al.  NON‐WELL‐FOUNDED SETS (CSLI Lecture Notes 14) , 1991 .

[8]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[9]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[10]  Toru Tsujishita,et al.  Monoidal closedness of the category of simulations , 1997 .

[11]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[12]  John Power,et al.  An axiomatics for categories of coalgebras , 1998, CMCS.

[13]  D. Turi,et al.  Functional Operational Semantics and its Denotational Dual , 1996 .

[14]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[15]  G. M.,et al.  Mathematical Monographs , 2022, Nature.

[16]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[17]  Marcelo P. Fiore.  A Coinduction Principle for Recursive Data Types Based on Bisimulation , 1996, Inf. Comput..

[18]  S. Eilenberg,et al.  Adjoint functors and triples , 1965 .