Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation

Electronic Notes in Theoretical Computer Science

Volumn 229, Issue 1, 2009, Pages 165-182

  Coletta, Alessio ^a   Gori, Roberta ^a   Levi, Francesca ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Abstract Interpretation; Probabilistic Temporal Properties; Stochastic calculus

Indexed keywords

ABSTRACTING; BIOLOGICAL SYSTEMS; CALCULATIONS; INFORMATION THEORY; MARKOV PROCESSES; RANDOM PROCESSES; SEMICONDUCTING INTERMETALLICS; STOCHASTIC MODELS;

ABSTRACT INTERPRETATION; BIOCHEMICAL REACTIONS; FIXPOINTS; INFINITE STATE-SYSTEMS; INITIAL CONCENTRATIONS; LABELED TRANSITION SYSTEMS; LOWER AND UPPER BOUNDS; MARKOV CHAINS; PROBABILISTIC BEHAVIORS; PROBABILISTIC TEMPORAL PROPERTIES; PROGRAM ANALYSIS; STOCHASTIC CALCULUS; TEMPORAL PROPERTIES;

PROGRAM INTERPRETERS;

EID: 60449088482     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.02.011     Document Type: Article

References (35)

1. de Alfaro L., and Roy P. Magnifying-Lens Abstraction for Markov decision Process. Proc. of CAV'07. LNCS 4590 (2007) 325-338
2. Bodei C., Degano P., Nielson F., and Riis Nielson H. Static Analysis for the Pi-Calculus with Applications to Security. Information and Computation 168 (2001) 68-92
3. Cardelli L. Brane Calculi. Proc. of CMSB'04. LNCS 3082 (2004) 257-278
4. Cardelli L. On Process Rate Semantics. Theoretical Computer Science 391 (2008) 190-215
5. Chabrier N., arc Chiaverini M., incent Danos V., and Fages F. Modeling and Querying Biomolecular Interaction Networks. Theoretical Computer Science 325 1 (2004) 25-44
6. Clarke M., Grumberg O., and Long E. Model Checking and Abstraction. TOPLAS 16 5 (1994) 1512-1542
7. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Programs. Proc. of POPL'76, 106-130, 1976
8. 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
9. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. Proc. of POPL'79, 269-282, 1979
10. Cousot P., and Cousot R. Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. Proc. of PLILP'92. LNCS 631 (1992) 269-295
11. Dams D., Gerth R., and Grumberg O. Abstract Interpretation of Reactive Systems. TOPLAS 19 2 (1997) 253-291
12. D'Argenio P., Jeannet B., Jensen H., and Larsen K. Reachability Analysis of Probabilistic Systems by Successive Refinements. Proc. of PAPM-PROMIV'01. LNCS 2165 (2001) 39-56
13. D'Argenio P., Jeannet B., Jensen H., and Larsen K. Reduction and Refinement Strategies for Probabilistic Analysis. Proc. of PAPM-PROMIV'02. LNCS 2399 (2002) 57-76
14. Fecher H., Leucker M., and Wolf V. Don't Know in Probabilistic Systems. Proc. of SPIN'06. LNCS 3925 (2006) 71-88
15. Feret J. Occurrence Counting Analysis for the pi-calculus. ENTCS 39 2 (2001)
16. Feret J. Abstract Interpretation-Based Static Analysis of Mobile Ambients. Proc. of SAS'01. LNCS 2126 (2001), Springer Verlag 412-430
17. Gori R., and Levi F. A new occurrence Counting analysis for BioAmbients. Proc. of APLAS'05. LNCS 3780 (2005) 381-400
18. Gori R., and Levi F. An Analysis for proving Temporal Properties of Biological Systems. Proc. of APLAS'06. LNCS 4279 (2006) 234-252
19. Hinton A., Kwiatkowska M., Norma G., and Parker D. PRISM: a tool for automatic verification of probabilistic systems. Proc. of TACAS'06. LNCS 3920 (2006), Springer-Verlag 441-444
20. Huth M. On finite-state approximants for probabilistic computation tree logic. Theoretical Computer Science 346 1 (2005) 113-134
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. Levi F., and Maffeis S. On Abstract Interpretation of Mobile Ambients. Information and Computation 188 (2004) 179-240
24. Monnieaux D. Abstract interpretation of programs as Markov Decision Processes. Science of Computer Programming 58 1-2 (2005) 179-205
25. Nielson F., Nielson H.R., and Hansen R.R. Validating firewalls using flow logics. Theoretical Computer Science 283 2 (2002) 381-418
26. Nielson F., Nielson H.R., and Pilegaard H. Spatial Analysis of BioAmbients. Proc. of SAS'04. LNCS 3148 (2004), Springer-Verlag 69-83
27. Phillips A., and Cardelli L. A Correct Abstract Machine for the Stochastic Pi-calculus. Proc. of BioCONCUR'04. ENTCS (2004)
28. Phillips A., and Cardelli L. Efficient, Correct Simulation of Biological Processes in the Stochastic Pi-calculus. Proc. of CMSB'07. LNCS 4695 (2007) 184-199
29. H. Pilegaard, F. Nielson and H.R. Nielson. Static Analysis of a Model of the LDL Degradation Pathway. Proc. of CMSB'05, 2005
30. Priami C. Stochastic π-calculus. The Computer Journal 38 (1995) 578-589
31. Priami C., and Quaglia P. Beta binders for biological interactions. Proc. of CMSB'04. LNCS 3082 (2005) 20-33
32. Priami C., Regev A., Silverman W., and Shapiro E. Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Information Processing Letters 80 1 (2001) 25-31
33. Regev A., Panina E.M., Silverman W., Cardelli L., and Shapiro E. BioAmbients: an Abstraction for Biological Compartments. Theoretical Computer Science 325 (2004) 141-167
34. 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
35. Sen K., Viswanathan M., and Agha G. Model Checking Markov Chains in the Presence of Uncernainties. Proc. of TACAS'06. LNCS 3920 (2006) 394-410