Termination problems in chemical kinetics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5201 LNCS, Issue , 2008, Pages 477-491

  Zavattaro, Gianluigi ^a   Cardelli, Luca ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

CHEMICAL KINETICS; GREAT-ER; NONDETERMINISTIC FRAMEWORKS; PROCESS ALGEBRAS; STOCHASTIC; TERMINATION PROBLEMS;

PROBABILITY;

EID: 54249100471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_37     Document Type: Conference Paper

References (8)

1. Abdulla, P., Baier, C., Iyer, P., Jonsson, B.: Reasoning about Probabilistic Lossy Channel Systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 320-333. Springer, Heidelberg (2000)
2. Cardelli, L.: On Process Rate Semantics. Theoretical Computer Science (in press, 2008), http://dx.doi.org/10.1016/j.tcs.2007.11.012
3. Carstensen, H.: Decidability Questions for Fairness in Petri Nets. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 396-407. Springer, Heidelberg (1987)
4. Esparza, J., Nielsen, M.: Decidability Issues for Petri Nets, Technical report BRICS RS-94-8 (1994)
5. Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains. Springer, Heidelberg (1976)
6. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
7. Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)
8. Soloveichik, D., Cook, M., Winfree, E., Bruck, J.: Computation with Finite Stochastic Chemical Reaction Networks. Natural Computing (in press, 2008), http://dx.doi.org/10.1007/s11047-008-9067-y