Weak Bisimulations for Coalgebras over Ordered Functors - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Weak Bisimulations for Coalgebras over Ordered Functors

(1)
1
Tomasz Brengos
  • Function : Author
  • PersonId : 995261

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.
Fichier principal
Vignette du fichier
978-3-642-33475-7_7_Chapter.pdf (356.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01556223 , version 1 (04-07-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
29 View
65 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More