Decidability questions for fairness in Petri nets
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Communication and Concurrency
Reasoning about Probabilistic Lossy Channel Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Computation: finite and infinite machines
Computation: finite and infinite machines
Theoretical Computer Science
Computation with finite stochastic chemical reaction networks
Natural Computing: an international journal
Experiments on the reliability of stochastic spiking neural P systems
Natural Computing: an international journal
On the Expressive Power of Restriction and Priorities in CCS with Replication
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Strand algebras for DNA computing
Natural Computing: an international journal
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
| Hi-index | 0.00 |
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.