Maximally Parallel Probabilistic Semantics for Multiset Rewriting

  • Authors:
  • Roberto Barbuti;Francesca Levi;Paolo Milazzo;Guido Scatena

  • Affiliations:
  • Dip. di Informatica, Univ. di Pisa, Largo B. Pontecorvo 3, 56127 - Pisa, Italy. {barbuti,milazzo,levifran}@di.unipi.it;Dip. di Informatica, Univ. di Pisa, Largo B. Pontecorvo 3, 56127 - Pisa, Italy. {barbuti,milazzo,levifran}@di.unipi.it;Dip. di Informatica, Univ. di Pisa, Largo B. Pontecorvo 3, 56127 - Pisa, Italy. {barbuti,milazzo,levifran}@di.unipi.it;(Correspd.) IMT Lucca Inst. for Advanced Studies, Piazza San Ponziano 6, 55100 - Lucca, Italy. scatena.guido@gmail.com

  • Venue:
  • Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Maximally parallel semantics have been proposed for many formalisms as an alternative to the standard interleaving semantics for some modelling scenarios. Nevertheless, in the probabilistic setting an affirmed interpretation of maximal parallelism still lacks. We define a synchronous maximally parallel probabilistic semantics for multiset rewriting tailored to describe, simulate and verify biological systems evolving with maximally parallel steps. Each step of the proposed semantics is parallel as each reaction can happen multiple times, and it is maximal as it leaves no enabled reaction i.e. as many reactions as possible are executed. We define a maximally parallel probabilistic semantics in terms of Discrete Time Markov Chain for systems described by stochastic multiset rewriting. We propose a simple, maximally parallel, model of Caenorhabditis elegans vulval development on which we show probabilistic simulations results.