메뉴 건너뛰기




Volumn 5643 LNCS, Issue , 2009, Pages 337-352

Sliding window abstraction for infinite markov chains

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT MODELS; ABSTRACTION TECHNIQUES; BIOCHEMICAL REACTIONS; COMPLETE INFORMATION; CONTINUOUS TIME MARKOV CHAIN; FINITE MARKOV CHAIN; FINITE SET; INFINITE CHAINS; INFINITE-STATE; MARKOV CHAIN; ON-THE-FLY; SLIDING WINDOW; SPECIFIC TIME; STOCHASTIC MODELING; SYSTEMS BIOLOGY; TIME INSTANCES; TRANSIENT PROBABILITIES;

EID: 70350241659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_27     Document Type: Conference Paper
Times cited : (76)

References (47)
  • 1
    • 84885197071 scopus 로고    scopus 로고
    • Reasoning about probabilistic lossy channel systems
    • Palamidessi, C, ed, CONCUR 2000, Springer, Heidelberg
    • Abdulla, P., Baier, C., Iyer, S., Jonsson, B.: Reasoning about probabilistic lossy channel systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 320-333. Springer, Heidelberg (2000)
    • (2000) LNCS , vol.1877 , pp. 320-333
    • Abdulla, P.1    Baier, C.2    Iyer, S.3    Jonsson, B.4
  • 2
    • 26444582943 scopus 로고    scopus 로고
    • Verification of probabilistic systems with faulty communication
    • Abdulla, P., Bertrand, N., Rabinovich, A., Schnoebelen, P.: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2), 141-165 (2005)
    • (2005) Inf. Comput , vol.202 , Issue.2 , pp. 141-165
    • Abdulla, P.1    Bertrand, N.2    Rabinovich, A.3    Schnoebelen, P.4
  • 3
    • 26844442704 scopus 로고    scopus 로고
    • Abdulla, P., Henda, N.B., Mayr, R.: Verifying infinite Markov chains with a finite attractor or the global coarseness property. In: Proc. LICS 2005, pp. 127-136. IEEE Computer Society, Los Alamitos (2005)
    • Abdulla, P., Henda, N.B., Mayr, R.: Verifying infinite Markov chains with a finite attractor or the global coarseness property. In: Proc. LICS 2005, pp. 127-136. IEEE Computer Society, Los Alamitos (2005)
  • 4
    • 0031879114 scopus 로고    scopus 로고
    • Stochastic kinetic analysis of developmental pathway bifurcation in phage λ-infected escherichia coli cells
    • Arkin, A., Ross, J., McAdams, H.H.: Stochastic kinetic analysis of developmental pathway bifurcation in phage λ-infected escherichia coli cells. Genetics 149, 1633-1648 (1998)
    • (1998) Genetics , vol.149 , pp. 1633-1648
    • Arkin, A.1    Ross, J.2    McAdams, H.H.3
  • 7
    • 35348848671 scopus 로고    scopus 로고
    • A Krylov-based finite state projection algorithm for solving the chemical master equation arising in the discrete modelling of biological systems
    • Boson Books
    • Burrage, K., Hegland, M., Macnamara, F., Sidje, B.: A Krylov-based finite state projection algorithm for solving the chemical master equation arising in the discrete modelling of biological systems. In: Proc. of the Markov 150th Anniversary Conference, pp. 21-38. Boson Books (2006)
    • (2006) Proc. of the Markov 150th Anniversary Conference , pp. 21-38
    • Burrage, K.1    Hegland, M.2    Macnamara, F.3    Sidje, B.4
  • 8
    • 33845196693 scopus 로고    scopus 로고
    • Busch, H., Sandmann, W., Wolf, V.: A numerical aggregation algorithm for the enzymecatalyzed substrate conversion. In: Priami, C. (ed.) CMSB 2006. LNCS (LNBI), 4210, pp. 298-311. Springer, Heidelberg (2006)
    • Busch, H., Sandmann, W., Wolf, V.: A numerical aggregation algorithm for the enzymecatalyzed substrate conversion. In: Priami, C. (ed.) CMSB 2006. LNCS (LNBI), vol. 4210, pp. 298-311. Springer, Heidelberg (2006)
  • 10
    • 84957809842 scopus 로고    scopus 로고
    • Reachability analysis of probabilistic systems by successive refinements
    • de Luca, L, Gilmore, S, eds, PROBMIV 2001, PAPMPROBMIV 2001, and PAPM 2001, Springer, Heidelberg
    • D'Argenio, P., Jeannet, B., Jensen, H., Larsen, K.: Reachability analysis of probabilistic systems by successive refinements. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPMPROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, pp. 39-56. Springer, Heidelberg (2001)
    • (2001) LNCS , vol.2165 , pp. 39-56
    • D'Argenio, P.1    Jeannet, B.2    Jensen, H.3    Larsen, K.4
  • 11
    • 38149113949 scopus 로고    scopus 로고
    • de Alfaro, L., Pritam, R.: Magnifying-lens abstraction for Markov decision processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, 4590, pp. 325-338. Springer, Heidelberg (2007)
    • de Alfaro, L., Pritam, R.: Magnifying-lens abstraction for Markov decision processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 325-338. Springer, Heidelberg (2007)
  • 12
    • 70350221400 scopus 로고    scopus 로고
    • Approximation of event probabilities in noisy cellular processes
    • Technical Report MTC-REPORT-2009-002, EPF Lausanne, Switzerland
    • Didier, F., Henzinger, T.A., Mateescu, M., Wolf, V.: Approximation of event probabilities in noisy cellular processes. Technical Report MTC-REPORT-2009-002, EPF Lausanne, Switzerland (2009), http://infoscience.epfl. ch/record/135535
    • (2009)
    • Didier, F.1    Henzinger, T.A.2    Mateescu, M.3    Wolf, V.4
  • 13
    • 35048813444 scopus 로고    scopus 로고
    • Verifying probabilistic procedural programs
    • Lodaya, K, Mahajan, M, eds, FSTTCS 2004, Springer, Heidelberg
    • Esparza, J., Etessami, K.: Verifying probabilistic procedural programs. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 16-31. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3328 , pp. 16-31
    • Esparza, J.1    Etessami, K.2
  • 14
    • 4544326530 scopus 로고    scopus 로고
    • Esparza, J., Kucera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: Proc. LICS 2004, pp. 12-21. IEEE Computer Society, Los Alamitos (2004)
    • Esparza, J., Kucera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: Proc. LICS 2004, pp. 12-21. IEEE Computer Society, Los Alamitos (2004)
  • 15
    • 24644481560 scopus 로고    scopus 로고
    • Algorithmic verification of recursive probabilistic state machines
    • Halbwachs, N, Zuck, L.D, eds, TACAS 2005, Springer, Heidelberg
    • Etessami, K., Yannakakis, M.: Algorithmic verification of recursive probabilistic state machines. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 253-270. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3440 , pp. 253-270
    • Etessami, K.1    Yannakakis, M.2
  • 17
    • 0021385426 scopus 로고
    • The randomization technique as a modeling tool and solution procedure for transient Markov processes
    • Gross, D., Miller, D.: The randomization technique as a modeling tool and solution procedure for transient Markov processes. Operations Research 32(2), 926-944 (1984)
    • (1984) Operations Research , vol.32 , Issue.2 , pp. 926-944
    • Gross, D.1    Miller, D.2
  • 20
    • 0037109565 scopus 로고    scopus 로고
    • Approximate simulation of coupled fast and slow reactions for stochastic chemical kinetics
    • Haseltine, E., Rawlings, J.: Approximate simulation of coupled fast and slow reactions for stochastic chemical kinetics. The Journal of Chemical Physics 117(15), 6959-6969 (2002)
    • (2002) The Journal of Chemical Physics , vol.117 , Issue.15 , pp. 6959-6969
    • Haseltine, E.1    Rawlings, J.2
  • 21
    • 0034050722 scopus 로고    scopus 로고
    • Noise-based switches and amplifiers for gene expression
    • Hasty, J., Pradines, J., Dolnik, M., Collins, J.J.: Noise-based switches and amplifiers for gene expression. PNAS 97, 2075 (2000)
    • (2000) PNAS , vol.97 , pp. 2075
    • Hasty, J.1    Pradines, J.2    Dolnik, M.3    Collins, J.J.4
  • 22
    • 70349371001 scopus 로고    scopus 로고
    • Linking systems biology models to data: A stochastic kinetic model of p53 oscillations
    • O'Hagan, A, West, M, eds, Oxford University Press, Oxford
    • Henderson, D.A., Boys, R.J., Proctor, C.J., Wilkinson, D.J.: Linking systems biology models to data: a stochastic kinetic model of p53 oscillations. In: O'Hagan, A., West, M. (eds.) Handbook of Applied Bayesian Analysis, Oxford University Press, Oxford (2009)
    • (2009) Handbook of Applied Bayesian Analysis
    • Henderson, D.A.1    Boys, R.J.2    Proctor, C.J.3    Wilkinson, D.J.4
  • 23
    • 70350213943 scopus 로고    scopus 로고
    • Sliding window abstraction for infinite Markov chains
    • Technical Report MTC-REPORT-2009-003, EPF Lausanne, Switzerland
    • Henzinger, T.A., Mateescu, M., Wolf, V.: Sliding window abstraction for infinite Markov chains. Technical Report MTC-REPORT-2009-003, EPF Lausanne, Switzerland (2009), http://infoscience.epfl.ch/record/135537
    • (2009)
    • Henzinger, T.A.1    Mateescu, M.2    Wolf, V.3
  • 24
    • 84945610644 scopus 로고
    • Markoff chains as an aid in the study of Markoff processes
    • Jensen, A.: Markoff chains as an aid in the study of Markoff processes. Skandinavisk Aktuarietidskrift 36, 87-91 (1953)
    • (1953) Skandinavisk Aktuarietidskrift , vol.36 , pp. 87-91
    • Jensen, A.1
  • 26
    • 38149121410 scopus 로고    scopus 로고
    • Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time Markov chains. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, 4590, pp. 316-329. Springer, Heidelberg (2007)
    • Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time Markov chains. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 316-329. Springer, Heidelberg (2007)
  • 27
    • 31144440884 scopus 로고    scopus 로고
    • Kucera, A.: Methods for quantitative analysis of probabilistic pushdown automata. Electr. Notes Theor. Comput. Sci. 149(1), 3-15 (2006)
    • Kucera, A.: Methods for quantitative analysis of probabilistic pushdown automata. Electr. Notes Theor. Comput. Sci. 149(1), 3-15 (2006)
  • 28
    • 37149003984 scopus 로고    scopus 로고
    • Game-based abstraction for Markov decision processes. In: QEST
    • Los Alamitos
    • Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: QEST, pp. 157-166. IEEE CS Press, Los Alamitos (2006)
    • (2006) IEEE CS Press , pp. 157-166
    • Kwiatkowska, M.1    Norman, G.2    Parker, D.3
  • 29
    • 0023400561 scopus 로고
    • Transient analysis of acyclic Markov chains
    • Marie, R.A., Reibman, A.L., Trivedi, K.S.: Transient analysis of acyclic Markov chains. Perform. Eval. 7(3), 175-194 (1987)
    • (1987) Perform. Eval , vol.7 , Issue.3 , pp. 175-194
    • Marie, R.A.1    Reibman, A.L.2    Trivedi, K.S.3
  • 31
    • 0037354371 scopus 로고    scopus 로고
    • Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later
    • Moler, C., Van Loan, C.: Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Review 45(1), 3-49 (2003)
    • (2003) SIAM Review , vol.45 , Issue.1 , pp. 3-49
    • Moler, C.1    Van Loan, C.2
  • 32
    • 33751347484 scopus 로고    scopus 로고
    • The finite state projection algorithm for the solution of the chemical master equation
    • Munsky, B., Khammash, M.: The finite state projection algorithm for the solution of the chemical master equation. J. Chem. Phys. 124, 44144 (2006)
    • (2006) J. Chem. Phys , vol.124 , pp. 44144
    • Munsky, B.1    Khammash, M.2
  • 33
    • 0003781238 scopus 로고    scopus 로고
    • 1st edn. Cambridge University Press, Cambridge
    • Norris, J.: Markov Chains, 1st edn. Cambridge University Press, Cambridge (1999)
    • (1999) Markov Chains
    • Norris, J.1
  • 35
    • 0842285841 scopus 로고    scopus 로고
    • Summing up the noise in gene networks
    • Paulsson, J.: Summing up the noise in gene networks. Nature 427 (6973), 415-418 (2004)
    • (2004) Nature , vol.427 , Issue.6973 , pp. 415-418
    • Paulsson, J.1
  • 36
    • 33751566347 scopus 로고    scopus 로고
    • Reduction and solution of the chemical master equation using time scale separation and finite state projection
    • Peles, S., Munsky, B., Khammash, M.: Reduction and solution of the chemical master equation using time scale separation and finite state projection. J. Chem. Phys. 125, 204104 (2006)
    • (2006) J. Chem. Phys , vol.125 , pp. 204104
    • Peles, S.1    Munsky, B.2    Khammash, M.3
  • 38
    • 84855197572 scopus 로고    scopus 로고
    • Quantitative analysis of probabilistic lossy channel systems
    • Rabinovich, A.: Quantitative analysis of probabilistic lossy channel systems. Inf. Comput. 204(5), 713-740 (2006)
    • (2006) Inf. Comput , vol.204 , Issue.5 , pp. 713-740
    • Rabinovich, A.1
  • 39
    • 0037078982 scopus 로고    scopus 로고
    • Control, exploitation and tolerance of intracellular noise
    • Rao, C., Wolf, D., Arkin, A.: Control, exploitation and tolerance of intracellular noise. Nature 420 (6912), 231-237 (2002)
    • (2002) Nature , vol.420 , Issue.6912 , pp. 231-237
    • Rao, C.1    Wolf, D.2    Arkin, A.3
  • 45
    • 0035902599 scopus 로고    scopus 로고
    • Intrinsic noise in gene regulatory networks
    • Thattai, M., van Oudenaarden, A.: Intrinsic noise in gene regulatory networks. PNAS 98(15), 8614-8619 (2001)
    • (2001) PNAS , vol.98 , Issue.15 , pp. 8614-8619
    • Thattai, M.1    van Oudenaarden, A.2
  • 46
    • 56249093501 scopus 로고    scopus 로고
    • Signatures of combinatorial regulation in intrinsic biological noise
    • Warmflash, A., Dinner, A.: Signatures of combinatorial regulation in intrinsic biological noise. PNAS 105(45), 17262-17267 (2008)
    • (2008) PNAS , vol.105 , Issue.45 , pp. 17262-17267
    • Warmflash, A.1    Dinner, A.2
  • 47
    • 51549111990 scopus 로고    scopus 로고
    • Zhang, L., Hermanns, H., Moritz Hahn, E., Wachter, B.: Time-bounded model checking of infinite-state continuous-time Markov chains. In: ACSD, China (2008)
    • Zhang, L., Hermanns, H., Moritz Hahn, E., Wachter, B.: Time-bounded model checking of infinite-state continuous-time Markov chains. In: ACSD, China (2008)


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