메뉴 건너뛰기




Volumn 81, Issue 4, 2012, Pages 356-389

Three-valued abstraction for probabilistic systems

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION METHODS; ABSTRACTION TECHNIQUES; CONTINUOUS STOCHASTIC LOGIC; CONTINUOUS TIME; CONTINUOUS TIME MARKOV CHAIN; KRIPKE STRUCTURE; NEGATIVE EXPONENTIAL DISTRIBUTION; PROBABILISTIC COMPUTATION; PROBABILISTIC SYSTEMS; RESIDENCE TIME; STATE SPACE; THREE-VALUED; TIME-BOUNDED REACHABILITY; TRANSITION PROBABILITIES; VERIFICATION RESULTS;

EID: 84860388553     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2012.03.007     Document Type: Article
Times cited : (38)

References (58)
  • 2
    • 84941709469 scopus 로고    scopus 로고
    • Model-checking continuous time Markov chains
    • A. Aziz, K. Sanwal, V. Singhal, and R. Brayton Model-checking continuous time Markov chains ACM TOCL 1 1 2000 162 170
    • (2000) ACM TOCL , vol.1 , Issue.1 , pp. 162-170
    • Aziz, A.1    Sanwal, K.2    Singhal, V.3    Brayton, R.4
  • 4
  • 5
  • 6
    • 0042349303 scopus 로고    scopus 로고
    • Model-checking algorithms for continuous-time Markov chains
    • C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen Model-checking algorithms for continuous-time Markov chains IEEE TSE 29 6 2003 524 541
    • (2003) IEEE TSE , vol.29 , Issue.6 , pp. 524-541
    • Baier, C.1    Haverkort, B.2    Hermanns, H.3    Katoen, J.-P.4
  • 7
    • 29144460595 scopus 로고    scopus 로고
    • ProbMela and verification of Markov decision processes
    • C. Baier, F. Ciesinski, and M. Größer ProbMela and verification of Markov decision processes Perform. Eval. Rev. 32 4 2005 22 27
    • (2005) Perform. Eval. Rev. , vol.32 , Issue.4 , pp. 22-27
    • Baier, C.1    Ciesinski, F.2    Größer, M.3
  • 8
    • 21244460040 scopus 로고    scopus 로고
    • Comparative branching-time semantics for Markov chains
    • DOI 10.1016/j.ic.2005.03.001, PII S0890540105000441
    • C. Baier, J.-P. Katoen, H. Hermanns, and V. Wolf Comparative branching-time semantics for Markov chains Inform. and Comput. 200 2 2005 149 214 (Pubitemid 40893944)
    • (2005) Information and Computation , vol.200 , Issue.2 , pp. 149-214
    • Baier, C.1    Katoen, J.-P.2    Hermanns, H.3    Wolf, V.4
  • 9
    • 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 TCS 345 1 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
  • 11
    • 60649112340 scopus 로고    scopus 로고
    • Stochastic Petri nets: An introduction to the theory
    • F. Bause, P.S. Kritzinger, Stochastic Petri nets: an introduction to the theory, SIGMETRICS Performance Eval. Rev. 26 (2), http://dx.doi.org/http://doi. acm.org/10.1145/288197.581194.
    • SIGMETRICS Performance Eval. Rev. , vol.26 , Issue.2
    • Bause, F.1    Kritzinger, P.S.2
  • 13
  • 20
    • 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 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
  • 25
    • 84959928148 scopus 로고
    • The PEPA workbench: A tool to support a process algebra-based approach to performance modelling
    • LNCS Springer
    • S. Gilmore, and J. Hillston The PEPA workbench: a tool to support a process algebra-based approach to performance modelling Computer Performance Evaluation LNCS vol. 794 1994 Springer 353 368
    • (1994) Computer Performance Evaluation , vol.794 , pp. 353-368
    • Gilmore, S.1    Hillston, J.2
  • 27
    • 0021385426 scopus 로고
    • Randomization technique as a modeling tool and solution procedure for transient markov processes
    • D. Gross, and D. Miller The randomization technique as a modeling tool and solution procedure for transient Markov chains Oper. Res. 32 2 1984 343 361 (Pubitemid 14585178)
    • (1984) Operations Research , vol.32 , Issue.2 , pp. 343-361
    • Gross Donald1    Miller Douglas, R.2
  • 29
    • 0003096318 scopus 로고
    • A logic for reasoning about time and reliability
    • H. Hansson, and B. Jonsson A logic for reasoning about time and reliability Formal Aspects Comput. 6 5 1994 512 535
    • (1994) Formal Aspects Comput. , vol.6 , Issue.5 , pp. 512-535
    • Hansson, H.1    Jonsson, B.2
  • 32
    • 33745772616 scopus 로고    scopus 로고
    • An abstraction framework for mixed non-deterministic and probabilistic systems
    • LNCS Springer
    • M. Huth An abstraction framework for mixed non-deterministic and probabilistic systems Validation of Stoch. Systems LNCS vol. 2925 2004 Springer 419 444
    • (2004) Validation of Stoch. Systems , vol.2925 , pp. 419-444
    • Huth, M.1
  • 33
    • 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 TCS 346 1 2005 113 134 (Pubitemid 41606837)
    • (2005) Theoretical Computer Science , vol.346 , Issue.1 , pp. 113-134
    • Huth, M.1
  • 34
    • 35048831379 scopus 로고    scopus 로고
    • Modal Transition Systems: A Foundation for Three-Valued Program Analysis
    • Programming Languages and Systems
    • M. Huth, R. Jagadeesan, and D. Schmidt Modal transition systems: a foundation for three-valued program analysis Lecture Notes in Comput. Sci. 2028 2001 155 169 (Pubitemid 33256357)
    • (2001) Lecture Notes in Computer Science , Issue.2028 , pp. 155-169
    • Huth, M.1    Jagadeesan, R.2    Schmidt, D.3
  • 35
    • 70350656207 scopus 로고    scopus 로고
    • Three-valued abstractions of Markov chains: Completeness for a sizeable fragment of PCTL
    • LNCS Springer
    • M. Huth, N. Piterman, and D. Wagner Three-valued abstractions of Markov chains: completeness for a sizeable fragment of PCTL FCT LNCS vol. 5699 2009 Springer 205 216
    • (2009) FCT , vol.5699 , pp. 205-216
    • Huth, M.1    Piterman, N.2    Wagner, D.3
  • 38
    • 37149024894 scopus 로고    scopus 로고
    • Bisimulation minimisation mostly speeds up probabilistic model checking
    • LNCS Springer
    • J.-P. Katoen, T. Kemna, I. Zapreev, and D.N. Jansen Bisimulation minimisation mostly speeds up probabilistic model checking TACAS LNCS vol. 4424 2007 Springer 87 102
    • (2007) TACAS , vol.4424 , pp. 87-102
    • Katoen, J.-P.1    Kemna, T.2    Zapreev, I.3    Jansen, D.N.4
  • 43
    • 0036533632 scopus 로고    scopus 로고
    • Interval-valued finite Markov chains
    • DOI 10.1023/A:1014745904458
    • I.O. Kozine, and L.V. Utkin Interval-valued finite Markov chains Reliab. Comput. 8 2 2002 97 113 (Pubitemid 34254805)
    • (2002) Reliable Computing , vol.8 , Issue.2 , pp. 97-113
    • Kozine, I.O.1    Utkin, L.V.2
  • 44
    • 84896694223 scopus 로고    scopus 로고
    • Probabilistic symbolic model checking with PRISM: A hybrid approach
    • M. Kwiatkowska, G. Norman, and D. Parker Probabilistic symbolic model checking with PRISM: a hybrid approach Int. J. STTT 6 2 2004 128 142
    • (2004) Int. J. STTT , vol.6 , Issue.2 , pp. 128-142
    • Kwiatkowska, M.1    Norman, G.2    Parker, D.3
  • 54
    • 58149242745 scopus 로고    scopus 로고
    • Finite DTMCs with interval probabilities
    • Advances in Soft Computing Springer
    • D. Skulj Finite DTMCs with interval probabilities Soft Methods for Integrated Uncertainty Modelling 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
  • 56
    • 84981239199 scopus 로고
    • Algebraic reasoning for real-time probabilistic processes with uncertain information
    • LNCS Springer
    • W. Yi Algebraic reasoning for real-time probabilistic processes with uncertain information Formal Techniques in Real-Time and Fault-Tolerant Systems LNCS vol. 863 1994 Springer 680 693
    • (1994) Formal Techniques in Real-Time and Fault-Tolerant Systems , vol.863 , pp. 680-693
    • Yi, W.1
  • 57
    • 26444453810 scopus 로고    scopus 로고
    • Ymer: A statistical model checker
    • Computer Aided Verification: 17th International Conference, CAV 2005. Proceedings
    • H. Younes Ymer: a statistical model checker International Conference on Computer Aided Verification LNCS vol. 3567 2005 Springer Berlin 429 433 (Pubitemid 41431754)
    • (2005) Lecture Notes in Computer Science , vol.3576 , pp. 429-433
    • Younes, H.L.S.1


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