Sciweavers

Share
FMCO
2005
Springer

On a Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages

11 years 7 months ago
On a Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages
babilistic Chemical Abstract Machine and the Expressiveness of Linda Languages Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, University of Pisa, Italy 2 Department of Computing, Imperial College London, UK The Chemical Abstract Machine (CHAM) of Berry and Boudol provides a commonly accepted, uniform framework for describing the operational semantics of various process calculi and languages, such as for example CCS, the π calculus and coordination languages like Linda. In its original form the CHAM is purely non-deterministic and thus only describes what reactions are possible but not how long it will take (in the average) before a certain reaction takes place or its probability. Such quantitative information is however often vital for “real world” applications such as systems biology or performance analysis. We propose a probabilistic version of the CHAM. We then define a linear operator semantics for the probabilistic CHAM which exp...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where FMCO
Authors Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
Comments (0)
books