Weak bisimulations for coalgebras over ordered functors

Authors:
Tomasz Brengos
Affiliations:
Faculty of Mathematics and Information Sciences, Warsaw University of Technology, Warszawa, Poland
Venue:
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Year:
2012

Citing 6
Cited 0

Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Probabilistic Simulations for Probabilistic Processes

CONCUR '94 Proceedings of the Concurrency Theory
Weak Bisimulation for Fully Probabilistic Processes

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Simulations in coalgebra

Theoretical Computer Science - Selected papers of CMCS'03

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to introduce a coalgebraic setting in which it is possible to generalize and compare the two known approaches to defining weak bisimulation for labelled transition systems. We introduce two definitions of weak bisimulation for coalgebras over ordered functors, show their properties and give sufficient conditions for them to coincide. We formulate a weak coinduction principle.