Probabilistic Embedding: Experiments with Tuple-based Probabilistic Languages


pagemagnifierBibTeX_logo.pngmagnifierpage_white_acrobatmagnifier

Stefano Mariani, Andrea Omicini

“28th ACM Symposium on Applied Computing (SAC 2013)”, pages 1380-1382
18-22 March 2013

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

(keywords) Embedding, modular embedding, concurrent languages, coordination languages, probabilistic languages and systems, tuple-based languages

Poster Paper

Events

  • Coordination Models, Languages and Applications. Special Track of the 28th ACM Symposium on Applied Computing (CM @ SAC 2013) — 18/03/2013–22/03/2013

Publication

— authors

— status

published

— sort

paper in proceedings

— publication date

18-22 March 2013

— volume

28th ACM Symposium on Applied Computing (SAC 2013)

— pages

1380-1382

— address

Coimbra, Portugal

URLs

original page  |  original PDF

identifiers

— DOI

10.1145/2480362.2480621

— ACM

2480621

— IRIS

11585/134362

— Scopus

2-s2.0-84877995463

— print ISBN

978-1-4503-1656-9

notes

— note

Poster Paper

Partita IVA: 01131710376 — Copyright © 2008–2023 APICe@DISI – PRIVACY