Simulations in Coalgebra

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 similarity 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 bisimilarity 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 investigation of the iterated applications Fn(0) and Fn(1) of a functor F with an order to the initial algebras and final objects.

[1]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .

[2]  Andrew M. Pitts,et al.  A co-Induction Principle for Recursively Defined Domains , 1994, Theor. Comput. Sci..

[3]  Reiko Heckel,et al.  A Coalgebraic presentation of structured transition systems , 2001, Theor. Comput. Sci..

[4]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[5]  G. M. Kelly,et al.  A $2$-categorical approach to change of base and geometric morphisms I , 1991 .

[6]  Nancy A. Lynch,et al.  Forward and Backward Simulations: I. Untimed Systems , 1995, Inf. Comput..

[7]  Bart Jacobs,et al.  Structural Induction and Coinduction in a Fibrational Setting , 1998, Inf. Comput..

[8]  Bart Jacobs,et al.  Simulations in Coalgebra , 2003, CMCS.

[9]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[10]  Krzysztof Worytkiewicz.  Paths and Simulations , 2002, CTCS.

[11]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[12]  Jirí Adámek.  Final Coalgebras are Ideal Completions of Initial Algebras , 2002, J. Log. Comput..

[13]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[14]  Bart Jacobs,et al.  Exercises in Coalgebraic Specification , 2000, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction.

[15]  Jan J. M. M. Rutten.  Relators and Metric Bisimulations , 1998, CMCS.

[16]  Albert Thijs,et al.  Simulation and fixpoint semantics , 1996 .

[17]  N. Lynch,et al.  Forward and backward simulations , 1993 .

[18]  Alexandru Baltag,et al.  A Logic for Coalgebraic Simulation , 2000, CMCS.

[19]  Bart Jacobs,et al.  The temporal logic of coalgebras via Galois algebras , 2002, Mathematical Structures in Computer Science.

[20]  Marcelo P. Fiore,et al.  A coinduction principle for recursive data types based on bisimulation , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[21]  Bart Jacobs,et al.  Coalgebraic Theories of Sequences in PVS , 1999, J. Log. Comput..

[22]  Wim H. Hesselink,et al.  Fixpoint semantics and simulation , 2000, Theor. Comput. Sci..

[23]  Bart Jacobs,et al.  Coalgebras and Approximation , 1994, LFCS.

[24]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.