Abstract
Mediator is a component-based modeling language where components and systems can be specified separately and precisely. In this paper, we show how to analyze probabilistic Mediator, which supports both non-deterministic and probabilistic behavior of component-based systems, from a coalgebraic perspective. Probabilistic Mediator components are modeled as coalgebras, with the powerset monad P and the distribution monad D to capture their non-determinsitic and probabilistic behavior, respectively. A coalgebraic semantics of combinators on Mediator components is developed. Such a coalgebraic view induces a suitable notion of bisimulation for comparing probabilistic Mediator components and systems.
| Original language | English |
|---|---|
| Article number | 100808 |
| Journal | Journal of Logical and Algebraic Methods in Programming |
| Volume | 129 |
| DOIs | |
| State | Published - Nov 2022 |
| Externally published | Yes |
Keywords
- Bisimulation
- Coalgebra
- Combinator
- Component-based language
- Mediator
Fingerprint
Dive into the research topics of 'Probabilistic mediator: A coalgebraic perspective'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver