Abstract
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.
Chapter PDF
References
Wegner, P.: Why interaction is more powerful than algorithms. Communications of the ACM 40(5), 80–91 (1997)
Denti, E., Natali, A., Omicini, A.: On the expressive power of a language for programming coordination media. In: 1998 ACM Symposium on Applied Computing (SAC 1998), February 27-March 1, pp. 169–177. ACM, Atlanta (1998); Special Track on Coordination Models, Languages and Applications
Busi, N., Gorrieri, R., Zavattaro, G.: On the expressiveness of Linda coordination primitives. Information and Computation 156(1-2), 90–121 (2000)
Wegner, P., Goldin, D.: Computation beyond Turing machines. Communications of the ACM 46(4), 100–102 (2003)
de Boer, F.S., Palamidessi, C.: Embedding as a tool for language comparison. Information and Computation 108(1), 128–157 (1994)
Shapiro, E.: Separating concurrent languages with categories of language embeddings. In: 23rd Annual ACM Symposium on Theory of Computing (1991)
Omicini, A., Viroli, M.: Coordination models and languages: From parallel computing to self-organisation. The Knowledge Engineering Review 26(1), 53–59 (2011); Special Issue 01 (25th Anniversary Issue)
Omicini, A.: Nature-inspired coordination models: Current status, future trends. ISRN Software Engineering 2013, Article ID 384903, Review Article (2013)
Mariani, S., Omicini, A.: Probabilistic embedding: Experiments with tuple-based probabilistic languages. In: 28th ACM Symposium on Applied Computing (SAC 2013), Coimbra, Portugal, March 18-22, pp. 1380–1382 (2013) (Poster Paper)
Bravetti, M., Gorrieri, R., Lucchi, R., Zavattaro, G.: Quantitative information in the tuple space coordination model. Theoretical Computer Science 346(1), 28–57 (2005)
Bravetti, M.: Expressing priorities and external probabilities in process algebra via mixed open/closed systems. Electronic Notes in Theoretical Computer Science 194(2), 31–57 (2008)
van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Information and Computation 121(1), 59–80 (1995)
Drake, A.W.: Fundamentals of Applied Probability Theory. McGraw-Hill College (1967)
Di Pierro, A., Hankin, C., Wiklicky, H.: Probabilistic KLAIM. In: De Nicola, R., Ferrari, G.-L., Meredith, G. (eds.) COORDINATION 2004. LNCS, vol. 2949, pp. 119–134. Springer, Heidelberg (2004)
De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A kernel language for agent interaction and mobility. IEEE Transaction on Software Engineering 24(5), 315–330 (1998)
Herescu, O.M., Palamidessi, C.: Probabilistic asynchronous pi-calculus. CoRR cs.PL/0109002 (2001)
Boudol, G.: Asynchrony and the Pi-calculus. Rapport de recherche RR-1702, INRIA (1992)
Bengt, J., Larsen, K.G., Yi, W.: Probabilistic extensions of process algebras. In Bergstra, J.A., Ponse, A., Smolka, S.A., eds.: Handbook of Process Algebra. Elsevier Science B.V., pp. 685–710 (2001)
Brogi, A., Di Pierro, A., Wiklicky, H.: Linear embedding for a quantitative comparison of language expressiveness. Electronic Notes in Theoretical Computer Science 59(3), 207–237 (2002); Quantitative Aspects of Programming Languages (QAPL 2001 @ PLI 2001)
Di Pierro, A., Hankin, C., Wiklicky, H.: Quantitative relations and approximate process equivalences. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 508–522. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Mariani, S., Omicini, A. (2013). Probabilistic Modular Embedding for Stochastic Coordinated Systems. In: De Nicola, R., Julien, C. (eds) Coordination Models and Languages. COORDINATION 2013. Lecture Notes in Computer Science, vol 7890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38493-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-38493-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38492-9
Online ISBN: 978-3-642-38493-6
eBook Packages: Computer ScienceComputer Science (R0)