Reflection and preservation of properties in coalgebraic (bi)simulations

Authors:
Ignacio Fábregas;Miguel Palomino;David De Frutos Escrig
Affiliations:
Departamento de Sistemas Informáticos y Computación, UCM;Departamento de Sistemas Informáticos y Computación, UCM;Departamento de Sistemas Informáticos y Computación, UCM
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 9
Cited 0

Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Model checking

Model checking
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency

Communication and Concurrency
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Final Coalgebra Theorem

Category Theory and Computer Science
A hierarchy of probabilistic system types

Theoretical Computer Science - Selected papers of CMCS'03
Simulations in coalgebra

Theoretical Computer Science - Selected papers of CMCS'03
Generic forward and backward simulations

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our objective is to extend the standard results of preservation and reflection of properties by bisimulations to the coalgebraic setting, as well as to study under what conditions these results hold for simulations. The notion of bisimulation is the classical one, while for simulations we use that proposed by Hughes and Jacobs. As for properties, we start by using a generalization of linear temporal logic to arbitrary coalgebras suggested by Jacobs, and then an extension by Kurtz which includes atomic propositions too.