Abstract interpretation for probabilistic termination of biological systems

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 11, Issue , 2009, Pages 137-153

  Gori, Roberta ^a   Levi, Francesca ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BIOLOGICAL SYSTEMS; CALCULATIONS; MARKOV PROCESSES; MODEL CHECKING; PATHOLOGY; SEMANTICS;

ABSTRACT INTERPRETATIONS; INITIAL CONCENTRATION; INTERVAL MARKOV CHAINS; LOWER AND UPPER BOUNDS; PROBABILISTIC MODELING; PROBABILISTIC SEMANTICS; TERMINATION PROPERTY;

BIOINFORMATICS;

EID: 85020162689     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.11.9     Document Type: Conference Paper

References (35)

1. C. Bodei, P.Degano, F.Nielson and H. Riis Nielson. Static Analysis for the Pi-Calculus with Applications to Security. Information and Computation, 168: 68-92, 2001.
2. L. Cardelli. Brane Calculi. Proc. of CMSB '04, LNCS 3082, 257-278, 2004.
3. L. Cardelli. On Process Rate Semantics. Theoretical Computer Science, 391 190-215, 2008.
4. L. Cardelli. Algorithmic Bioprocesses. In A.Condon, D.Harel, J.N.Kok, A.Salomaa, E.Winfree (Eds.), Springer, 2009.
5. A. Coletta and R.Gori and F. Levi. Approximating probabilistic behaviours of biological systems using abstract interpretation. Proc. of FBTC '08, ENTCS 229 (1), 165-182, 2009.
6. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Programs. Proc. of POPL'76, 106-130, 1976.
7. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. Proc. of POPL'77, 238-252, 1977.
8. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. Proc. of POPL'79, 269-282, 1979.
9. P. Cousot and R. Cousot. Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. Proc. of PLILP'92, LNCS 631, 269-295, 1992.
10. D. Dams, R. Gerth and O. Grumberg. Abstract Interpretation of Reactive Systems. TOPLAS, 19(2), 253-291, 1997.
11. P. D'Argenio, B. Jeannet, H. Jensen and K. Larsen. Reachability Analysis of Probabilistic Systems by Successive Refinements. Proc. of PAPM-PROMIV'01, LNCS 2165, 39-56, 2001.
12. P. D'Argenio, B. Jeannet, H. Jensen and K. Larsen. Reduction and Refinement Strategies for Probabilistic Analysis. Proc. of PAPM-PROMIV'02, LNCS 2399, 57-76, 2002.
13. H. Fecher, M. Leucker and V. Wolf. Don't Know in Probabilistic Systems. Proc. of SPIN'06, LNCS 3925, 71-88, 2006.
14. J. Feret. Abstract Interpretation-Based Static Analysis of Mobile Ambients. Proc. of SAS'01, LNCS 2126, 412-430, Springer Verlag, 2001.
15. R.Gori and F. Levi. A new occurrence Counting analysis for Bio Ambients. Proc. of APLAS '05, LNCS 3780, 381-400, 2005.
16. R.Gori and F. Levi. An Analysis for proving Temporal Properties of Biological Systems. Proc. of APLAS '06, LNCS 4279, 234-252, 2006.
17. H. Hansson and B. Jonsson. A Logic for Reasoning about Time and Probability. Formal Aspects of Computing, 6(5), 512-535, 1994.
18. A. Hinton, M. Kwiatkowska, G. Norma and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. Proc. of TACAS'06, LNCS 3920, 441-444, Springer-Verlag, 2006.
19. M. Huth. On finite-state approximants for probabilistic computation tree logic. Theoretical Computer Science, 346(1), 113-134, 2005.
20. J.G. Kemeny, J.L. Snell and A.W. Knapp. Denumerable Markov Chains. Springer, 1976.
21. M. Kwiatkowska. Model checking for probability and time: from theory to practice. Proc. of LICS' 03, 351-360, 2003.
22. M. Kwiatkowska, G. Norman and D. Parker. Game-based Abstraction for Markov Decision Processes. Proc. of QEST'06, 157-166, 2006.
23. F. Levi and S. Maffeis. On Abstract Interpretation of Mobile Ambients. Information and Computation 188, 179-240, 2004.
24. D. Monniaux. Abstract interpretation of programs as Markov Decision Processes. Science of Computer Programming, 58(1-2), 179-205, 2005.
25. F. Nielson, H.R. Nielson, R.R. Hansen. Validating firewalls using flow logics. Theoretical Computer Science, 283(2), 381-418, 2002.
26. F. Nielson, H.R. Nielson and H. Pilegaard. Spatial Analysis of Bio Ambients. Proc. of SAS'04, LNCS 3148, pp. 69-83, Springer-Verlag, 2004.
27. A. Phillips and L. Cardelli. A Correct AbstractMachine for the Stochastic Pi-calculus. Proc. of BioCONCUR '04, ENTCS, 2004.
28. A. Phillips and L. Cardelli. Efficient, Correct Simulation of Biological Processes in the Stochastic Pi-calculus. Proc. of CMSB '07, LNCS 4695, 184-199, 2007.
29. C.Priami. Stochastic π-calculus. The Computer Journal, 38, 578-589, 1995.
30. C.Priami and P. Quaglia. Beta binders for biological interactions. Proc. of CMSB'04, LNCS 3082, 20- 33, 2005.
31. C. Priami, A. Regev, W. Silverman and E. Shapiro. Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Information Processing Letters, 80 (1), 25-31, 2001.
32. A. Regev, E. M. Panina, W. Silverman, L. Cardelli and E. Shapiro. Bio Ambients: An Abstraction for Biological Compartments. Theoretical Computer Science, 325, 141-167, 2004.
33. A. Regev, W. Silverman and E. Shapiro. Representation and Simulation of Biochemical Processes using the pi-calculus process algebra. Proc. of the Pacific Symposium on Biocomputing 2001, 6, 459-470, 2001.
34. K. Sen, M. Viswanathan and G. Agha. Model Checking Markov Chains in the Presence of Uncernainties. Proc. of TACAS'06, LNCS 3920, 394-410, 2006.
35. G. Zavattaro and L. Cardelli. Termination Problems in Chemical Kinetics. Proc. of CONCUR'08, LNCS 5201, 477-491, 2008.