Embedding and modular embedding are two well-known techniques for measuring and comparing the expressiveness of languages-sequential and concurrent programming languages, respectively. The emergence of new classes of computational systems featuring stochastic behaviours - such as pervasive, adaptive, self-organising systems - requires new tools for probabilistic languages. In this paper, we recall and refine the notion of probabilistic modular embedding (PME) as an extension to modular embedding meant to capture the expressiveness of stochastic systems, and show its application to different coordination languages providing probabilistic mechanisms for stochastic systems. © 2013 IFIP International Federation for Information Processing.
CITATION STYLE
Mariani, S., & Omicini, A. (2013). Probabilistic modular embedding for stochastic coordinated systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7890 LNCS, pp. 151–165). https://doi.org/10.1007/978-3-642-38493-6_11
Mendeley helps you to discover research relevant for your work.