Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CONCUR
2008
Springer

favoriteEmaildiscussreport

96views Distributed And Parallel Com...» more CONCUR 2008»

Termination Problems in Chemical Kinetics

13 years 6 months ago

Termination Problems in Chemical Kinetics

Download lucacardelli.name

We consider nondeterministic and probabilistic termination problems in a process algebra that is equivalent to basic chemistry. We show that the existence of a terminating computation is decidable, but that termination with any probability strictly greater than zero is undecidable. Moreover, we show that the fairness intrinsic in stochastic computations implies that termination of all computation paths is undecidable, while it is decidable in a nondeterministic framework.

Gianluigi Zavattaro, Luca Cardelli

Real-time Traffic

CONCUR 2008 | Distributed And Parallel Computing | Nondeterministic Framework | Probabilistic Termination Problems | Terminating Computation |

claim paper

Related Content

» Extracting Biochemical Reaction Kinetics from Time Series Data

» Adaptive Discrete Galerkin Methods Applied to the Chemical Master Equation

» Estimating Hidden Influences in Metabolic and Gene Regulatory Networks

» Nonuniform smallgain theorems for systems with unstable invariant sets

» Detonation Structure Simulation with AMROC

» Reconstructing Metabolic Networks Using Interval Analysis

» Modelling and Simulation for Physical Vapor

» Expressive Models for Synaptic Plasticity

» Memory Consistency Conditions for SelfAssembly Programming

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	CONCUR
Authors	Gianluigi Zavattaro, Luca Cardelli

Comments (0)