Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Coalgebraic Simulations and Congruences
verfasst von : H. Peter Gumm, Mehdi Zarrad
Erschienen in: Coalgebraic Methods in Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.