skip to main content
10.1145/2480362.2480621acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Probabilistic embedding: experiments with tuple-based probabilistic languages

Published:18 March 2013Publication History

ABSTRACT

We introduce probabilistic (modular) embedding as an extension to the well-known notion of modular embedding [5] conceived to capture the expressiveness of stochastic systems, focussing here on tuple-based probabilistic languages.

References

  1. J. Bengt, K. G. Larsen, and W. Yi. Probabilistic extensions of process algebras. In Handbook of Process Algebra, chapter 11, pages 685--710. Elsevier, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  2. M. Bravetti. Expressing priorities and external probabilities in process algebra via mixed open/closed systems. ENTCS, 194(2):31--57, 16 Jan. 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Brogi, A. Di Pierro, and H. Wiklicky. Linear embedding for a quantitative comparison of language expressiveness. ENTCS, 59(3):207--237, 2002.Google ScholarGoogle Scholar
  4. M. Casadei, M. Viroli, and L. Gardelli. On the collective sort problem for distributed tuple spaces. Sci. Comput. Programming, 74(9):702--722, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F. S. de Boer and C. Palamidessi. Embedding as a tool for language comparison. Information and Computation, 108(1):128--157, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Di Pierro, C. Hankin, and H. Wiklicky. Quantitative relations and approximate process equivalences. In CONCUR 2003, volume 2761 of LNCS, pages 498--512. Springer, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  7. A. W. Drake. Fundamentals of Applied Probability Theory. McGraw-Hill College, 1967. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing
    March 2013
    2124 pages
    ISBN:9781450316569
    DOI:10.1145/2480362

    Copyright © 2013 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 18 March 2013

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    SAC '13 Paper Acceptance Rate255of1,063submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader