Weak bisimulation for coalgebras over order enriched monads
The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as coalgebras whose type is a monad. We show that the visible and in...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Logical Methods in Computer Science e.V.
2015-06-01
|
| Serie: | Logical Methods in Computer Science |
| Soggetti: | |
| Accesso online: | https://lmcs.episciences.org/1574/pdf |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|