메뉴 건너뛰기




Volumn 419, Issue , 2012, Pages 2-16

Probabilistic model checking of biological systems with uncertain kinetic rates

Author keywords

Abstract interpretation; Interval Markov chains; Probabilistic model checking; Systems biology; Uncertain kinetic rates

Indexed keywords

ABSTRACT INTERPRETATIONS; EVOLUTION RULES; KINETIC RATES; LOWER AND UPPER BOUNDS; MULTISET REWRITING; PROBABILISTIC MODEL CHECKING; PROBABILISTIC SEMANTICS; REACHABILITY; SYSTEMS BIOLOGY; TUMOR GROWTH; UNCERTAIN KINETIC RATES;

EID: 84855944534     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.10.022     Document Type: Article
Times cited : (17)

References (45)
  • 1
    • 84855915039 scopus 로고    scopus 로고
    • AMSR2PRISM tool: http://www.di.unipi.it/msvbio/wiki/amsr2prism.
    • AMSR2PRISM Tool
  • 2
    • 27644578953 scopus 로고    scopus 로고
    • Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
    • DOI 10.1016/j.tcs.2005.07.022, PII S030439750500383X
    • C. Baier, H. Hermanns, J.P. Katoen, and B.R. Haverkort Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes Theoret. Comput. Sci. 345 2005 2 26 (Pubitemid 41562538)
    • (2005) Theoretical Computer Science , vol.345 , Issue.1 , pp. 2-26
    • Baier, C.1    Hermanns, H.2    Katoen, J.-P.3    Haverkort, B.R.4
  • 5
    • 84992268376 scopus 로고    scopus 로고
    • Probablisitic model checking of biological systems with uncertain kinetic rates
    • O. Bournez, I. Potapov, RP 2009 LNCS Springer
    • R. Barbuti, F. Levi, P. Milazzo, and G. Scatena Probablisitic model checking of biological systems with uncertain kinetic rates O. Bournez, I. Potapov, Reachability Problems RP 2009 LNCS vol. 5797 2009 Springer 64 78
    • (2009) Reachability Problems , vol.5797 , pp. 64-78
    • Barbuti, R.1    Levi, F.2    Milazzo, P.3    Scatena, G.4
  • 6
    • 84863928730 scopus 로고    scopus 로고
    • Computing Abstractions of Infinite State Systems Compositionally and Automatically
    • Computer Aided Verification
    • S. Bensalem, Y. Lakhnech, and S. Owre Computing abstractions of infinite state systems compositionally and automatically A.J. Hu, M.Y. Vardi, Computer Aided Verification CAV 1998 LNCS vol. 1427 1998 Springer 319 331 (Pubitemid 128092349)
    • (1998) Lecture Notes in Computer Science , Issue.1427 , pp. 319-331
    • Bensalem, S.1    Lakhnech, Y.2    Owre, S.3
  • 7
    • 38649092709 scopus 로고    scopus 로고
    • On process rate semantics
    • L. Cardelli On process rate semantics Theoret. Comput. Sci. 391 2008 190 215
    • (2008) Theoret. Comput. Sci. , vol.391 , pp. 190-215
    • Cardelli, L.1
  • 9
    • 0035441462 scopus 로고    scopus 로고
    • Verification of infinite-state dynamic systems using approximate quotient transition systems
    • DOI 10.1109/9.948467, PII S0018928601088018
    • A. Chutinan, and B.H. Krogh Verification of infinite-state dynamic systems using approximate quotient transition systems Trans. Autom. Control 26 2001 1401 1410 (Pubitemid 32981643)
    • (2001) IEEE Transactions on Automatic Control , vol.46 , Issue.9 , pp. 1401-1410
    • Chutinan, A.1    Krogh, B.H.2
  • 10
    • 60449088482 scopus 로고    scopus 로고
    • Approximating probabilistic behaviors of biological systems using abstract interpretation
    • FBTC 2008 ENTCS Elsevier
    • A. Coletta, R. Gori, and F. Levi Approximating probabilistic behaviors of biological systems using abstract interpretation Biology to Concurrency and Back FBTC 2008 ENTCS vol. 229 2009 Elsevier 165 182
    • (2009) Biology to Concurrency and Back , vol.229 , pp. 165-182
    • Coletta, A.1    Gori, R.2    Levi, F.3
  • 12
    • 85050550846 scopus 로고
    • Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
    • POPL 1977 ACM Press
    • P. Cousot, and R. Cousot Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints ACM Symposium on Principles of Programming Languages POPL 1977 1977 ACM Press 238 252
    • (1977) ACM Symposium on Principles of Programming Languages , pp. 238-252
    • Cousot, P.1    Cousot, R.2
  • 15
    • 78449272958 scopus 로고    scopus 로고
    • Abstracting the differential semantics of rule-based models: Exact and automated model reduction
    • LICS 2010 IEEE Computer Society
    • V. Danos, J. Feret, W. Fontana, H. Russell, and J. Krivine Abstracting the differential semantics of rule-based models: exact and automated model reduction Annual IEEE Symposium on Logic in Computer Science LICS 2010 2010 IEEE Computer Society 362 381
    • (2010) Annual IEEE Symposium on Logic in Computer Science , pp. 362-381
    • Danos, V.1    Feret, J.2    Fontana, W.3    Russell, H.4    Krivine, J.5
  • 16
    • 84957809842 scopus 로고    scopus 로고
    • Reachability Analysis of Probabilistic Systems by Successive Refinements
    • Process Algebra and Probabilistic Methods
    • P.R. D'Argenio, B. Jeannet, H.E. Jensen, and K.G. Larsen Reachability analysis of probabilistic systems by successive refinements L. de Alfaro, S. Gilmore, Process Algebra and Probabilistic Methods, Performance Modeling and Verification, PAPM-PROBMIV LNCS vol. 2165 2001 Springer 39 56 (Pubitemid 33332541)
    • (2001) Lecture Notes in Computer Science , Issue.2165 , pp. 39-56
    • D Argenio, P.R.1    Jeannet, B.2    Jensen, H.E.3    Larsen, K.G.4
  • 17
    • 0034593091 scopus 로고    scopus 로고
    • Concurrent constraint programming: Towards probabilistic abstract interpretation
    • PPDP 2000 ACM Press
    • A. Di Pierro, and H. Wiklicky Concurrent constraint programming: towards probabilistic abstract interpretation Principles and Practice of Declarative Programming PPDP 2000 2000 ACM Press 127 138
    • (2000) Principles and Practice of Declarative Programming , pp. 127-138
    • Di Pierro, A.1    Wiklicky, H.2
  • 20
    • 85020162689 scopus 로고    scopus 로고
    • Abstract interpretation for probabilistic termination of biological systems
    • G. Ciobanu, MeCBIC 2009 EPTCS
    • R. Gori, and F. Levi Abstract interpretation for probabilistic termination of biological systems G. Ciobanu, Membrane Computing and Biologically Inspired Process Calculi MeCBIC 2009 EPTCS vol. 11 2009 137 153
    • (2009) Membrane Computing and Biologically Inspired Process Calculi , vol.11 , pp. 137-153
    • Gori, R.1    Levi, F.2
  • 21
    • 74049119477 scopus 로고    scopus 로고
    • Using stochastic comparison for efficient model checking of uncertain markov chains
    • QEST'09 IEEE Computer Society
    • S. Haddad, and N. Pekergin Using stochastic comparison for efficient model checking of uncertain markov chains Quantitative Evaluation of Systems QEST'09 2009 IEEE Computer Society 177 186
    • (2009) Quantitative Evaluation of Systems , pp. 177-186
    • Haddad, S.1    Pekergin, N.2
  • 22
    • 77049121123 scopus 로고    scopus 로고
    • Time-bounded model checking of infinite-state continuous-time Markov chains
    • E.M. Hahn, H. Hermanns, B. Wachter, and L. Zhang Time-bounded model checking of infinite-state continuous-time Markov chains Fund. Inform. 95 2009 129 155
    • (2009) Fund. Inform. , vol.95 , pp. 129-155
    • Hahn, E.M.1    Hermanns, H.2    Wachter, B.3    Zhang, L.4
  • 24
    • 0003096318 scopus 로고
    • A logic for reasoning about time and reliability
    • H. Hansson, and B. Jonsson A logic for reasoning about time and reliability Form. Asp. Comput. 6 1994 512 535
    • (1994) Form. Asp. Comput. , vol.6 , pp. 512-535
    • Hansson, H.1    Jonsson, B.2
  • 25
    • 48949100538 scopus 로고    scopus 로고
    • Probabilistic CEGAR
    • A. Gupta, S. Malik, CAV 2008 LNCS Springer
    • H. Hermanns, B. Wachter, and L. Zhang Probabilistic CEGAR A. Gupta, S. Malik, Computer Aided Verification CAV 2008 LNCS vol. 5123 2008 Springer 162 175
    • (2008) Computer Aided Verification , vol.5123 , pp. 162-175
    • Hermanns, H.1    Wachter, B.2    Zhang, L.3
  • 26
    • 27744519323 scopus 로고    scopus 로고
    • On finite-state approximants for probabilistic computation tree logic
    • DOI 10.1016/j.tcs.2005.08.008, PII S0304397505004779
    • M. Huth On finite-state approximants for probabilistic computation tree logic Theoret. Comput. Sci. 246 2005 113 134 (Pubitemid 41606837)
    • (2005) Theoretical Computer Science , vol.346 , Issue.1 , pp. 113-134
    • Huth, M.1
  • 28
    • 38149121410 scopus 로고    scopus 로고
    • Three-valued abstraction for continuous-time Markov chains
    • W. Damm, H. Hermanns, CAV 2007 LNCS Springer
    • J.P. Katoen, D. Klink, M. Leucker, and V. Wolf Three-valued abstraction for continuous-time Markov chains W. Damm, H. Hermanns, Computer Aided Verification CAV 2007 LNCS vol. 4590 2007 Springer 311 324
    • (2007) Computer Aided Verification , vol.4590 , pp. 311-324
    • Katoen, J.P.1    Klink, D.2    Leucker, M.3    Wolf, V.4
  • 31
    • 0002244789 scopus 로고    scopus 로고
    • Interval computations: Introduction, uses, and resources
    • R.B. Kearfott Interval computations: introduction, uses, and resources Euromath Bull. 2 1996 95 112
    • (1996) Euromath Bull. , vol.2 , pp. 95-112
    • Kearfott, R.B.1
  • 33
    • 0036533632 scopus 로고    scopus 로고
    • Interval-valued finite Markov chains
    • DOI 10.1023/A:1014745904458
    • I. Kozine, and L.V. Utkin Interval-valued finite markov chains Reliab. Comput. 8 2002 97 113 (Pubitemid 34254805)
    • (2002) Reliable Computing , vol.8 , Issue.2 , pp. 97-113
    • Kozine, I.O.1    Utkin, L.V.2
  • 34
    • 84863981780 scopus 로고    scopus 로고
    • PRISM: Probabilistic symbolic model checker
    • T. Field, P.G. Harrison, J.T. Bradley, U. Harder, TOOLS 2002 LNCS Springer
    • M.Z. Kwiatkowska, G. Norman, and D. Parker PRISM: probabilistic symbolic model checker T. Field, P.G. Harrison, J.T. Bradley, U. Harder, Computer Performance Evaluation, Modelling Techniques and Tools TOOLS 2002 LNCS vol. 2324 2002 Springer 200 204
    • (2002) Computer Performance Evaluation, Modelling Techniques and Tools , vol.2324 , pp. 200-204
    • Kwiatkowska, M.Z.1    Norman, G.2    Parker, D.3
  • 35
    • 0042969046 scopus 로고    scopus 로고
    • Model checking for probability and time: From theory to practice
    • LICS 2003 IEEE Computer Society
    • M.Z. Kwiatkowska Model checking for probability and time: from theory to practice IEEE Symposium on Logic in Computer Science LICS 2003 2003 IEEE Computer Society 351 360
    • (2003) IEEE Symposium on Logic in Computer Science , pp. 351-360
    • Kwiatkowska, M.Z.1
  • 37
    • 46049098394 scopus 로고    scopus 로고
    • Model checking of infinite state space Markov chains by stochastic bounds
    • K. Al-Begain, A. Heindl, M. Telek, ASMTA 2008 LNCS Springer
    • M.B. Mamoun, and N. Pekergin Model checking of infinite state space Markov chains by stochastic bounds K. Al-Begain, A. Heindl, M. Telek, Analytical and Stochastic Modeling Techniques and Applications ASMTA 2008 LNCS vol. 5055 2008 Springer 264 278
    • (2008) Analytical and Stochastic Modeling Techniques and Applications , vol.5055 , pp. 264-278
    • Mamoun, M.B.1    Pekergin, N.2
  • 38
    • 24344475591 scopus 로고    scopus 로고
    • Abstract interpretation of programs as Markov decision processes
    • DOI 10.1016/j.scico.2005.02.008, PII S0167642305000481, Static Analysis Symposium 2003
    • D. Monniaux Abstract interpretation of programs as Markov decision processes Sci. Comput. Programming 58 2005 179 205 (Pubitemid 41261381)
    • (2005) Science of Computer Programming , vol.58 , Issue.1-2 , pp. 179-205
    • Monniaux, D.1
  • 41
    • 58149242745 scopus 로고    scopus 로고
    • Finite discrete time Markov chains with interval probabilities
    • J. Lawry, E. Miranda, A. Bugarn, S. Li, M.A. Gil, P. Grzegorzewski, O. Hryniewicz, SMPS 2006 Advances in Soft Computing Springer
    • D. Skulj Finite discrete time Markov chains with interval probabilities J. Lawry, E. Miranda, A. Bugarn, S. Li, M.A. Gil, P. Grzegorzewski, O. Hryniewicz, Soft Methods for Integrated Uncertainty Modelling SMPS 2006 Advances in Soft Computing vol. 37 2006 Springer 299 306
    • (2006) Soft Methods for Integrated Uncertainty Modelling , vol.37 , pp. 299-306
    • Skulj, D.1
  • 42
    • 70349767966 scopus 로고    scopus 로고
    • Discrete time markov chains with interval probabilities
    • D. Skulj Discrete time markov chains with interval probabilities Internat. J. Approx. Reason. 50 2009 1314 1329
    • (2009) Internat. J. Approx. Reason. , vol.50 , pp. 1314-1329
    • Skulj, D.1
  • 43
    • 1442290947 scopus 로고    scopus 로고
    • A delay differential equation model for tumor growth
    • DOI 10.1007/s00285-003-0211-0
    • M. Villasana, and A. Radunskaya A delay differential equation model for tumor growth J. Math. Biol. 47 2003 270 294 (Pubitemid 38272158)
    • (2003) Journal of Mathematical Biology , vol.47 , Issue.3 , pp. 270-294
    • Villasana, M.1    Radunskaya, A.2
  • 45
    • 27144550855 scopus 로고    scopus 로고
    • The theory of interval-probability as a unifying concept for uncertainty
    • G. De Cooman, F. Gagliardi Cozman, S. Moral, P. Walley (Eds.) ISIPTA
    • K. Weichselberger, The theory of interval-probability as a unifying concept for uncertainty, in: G. De Cooman, F. Gagliardi Cozman, S. Moral, P. Walley (Eds.), Imprecise Probabilities and their Applications, ISIPTA 1999, pp. 387396.
    • (1999) Imprecise Probabilities and Their Applications , pp. 387-396
    • Weichselberger, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.