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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Logical and Algebraic Methods in Programming
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
