Skip to Main content Skip to Navigation
Conference papers

Weak Bisimulations for Coalgebras over Ordered Functors

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01556223
Contributor : Hal Ifip <>
Submitted on : Tuesday, July 4, 2017 - 5:45:44 PM
Last modification on : Tuesday, July 4, 2017 - 5:47:02 PM
Long-term archiving on: : Friday, December 15, 2017 - 1:42:51 AM

File

978-3-642-33475-7_7_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Tomasz Brengos. Weak Bisimulations for Coalgebras over Ordered Functors. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.87-103, ⟨10.1007/978-3-642-33475-7_7⟩. ⟨hal-01556223⟩

Share

Metrics

Record views

82

Files downloads

161