Advertisement
Published in:
2014 | OriginalPaper | Chapter
Coalgebraic Simulations and Congruences
Authors : H. Peter Gumm, Mehdi Zarrad
Published in: Coalgebraic Methods in Computer Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
In a recent article Gorín and Schröder [3] study \(\lambda \)-simulations of coalgebras and relate them to preservation of positive formulae. Their main results assume that \(\lambda \) is a set of monotonic predicate liftings and their proofs are set-theoretical. We give a different definition of simulation, called strong simulation, which has several advantages:
Our notion agrees with that of [3] in the presence of monotonicity, but it has the advantage, that it allows diagrammatic reasoning, so several results from the mentioned paper can be obtained by simple diagram chases. We clarify the role of \(\lambda \)-monotonicity by showing the equivalence of We relate the notion to bisimulations and \(F\)-congruences - which are defined as pullbacks of homomorphisms. We show that
-
\(\lambda \) is monotonic
-
every simulation is strong
-
every bisimulation is a (strong) simulation
-
every F-congruence is a (strong) simulation.
-
if \(\lambda \) is a separating set, then each difunctional strong simulation is an \(F\)-congruence,
-
if \(\lambda \) is monotonic, then the converse is true: if each difunctional strong simulation is an \(F\)-congruence, then \(\lambda \) is separating.