메뉴 건너뛰기




Volumn 43, Issue 1, 2013, Pages 61-92

Automatic verification of competitive stochastic systems

Author keywords

Probabilistic model checking; Probabilistic temporal logic; Quantitative verification; Stochastic multi player games

Indexed keywords

AUTOMATIC VERIFICATION; COLLECTIVE DECISION MAKING; MODELLING AND ANALYSIS; MULTIPLAYER GAMES; PROBABILISTIC MODEL CHECKING; PROBABILISTIC SYSTEMS; PROBABILISTIC TEMPORAL LOGIC; QUANTITATIVE VERIFICATION;

EID: 84880076914     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-013-0183-7     Document Type: Article
Times cited : (136)

References (38)
  • 2
    • 0042908709 scopus 로고    scopus 로고
    • Alternating-time temporal logic
    • 2147096 10.1145/585265.585270
    • Alur R, Henzinger T, Kupferman O (2002) Alternating-time temporal logic. J ACM 49(5):672-713
    • (2002) J ACM , vol.49 , Issue.5 , pp. 672-713
    • Alur, R.1    Henzinger, T.2    Kupferman, O.3
  • 4
    • 35048822416 scopus 로고    scopus 로고
    • Discrete-Time Rewards Model-Checked
    • Formal Modeling and Analysis of Timed Systems First International Workshop, FORMATS 2003 Marseille, France, September 6-7, 2003 Revised Papers
    • Andova S, Hermanns H, Katoen J-P (2003) Discrete-time rewards model-checked. In: Proc of the formal modeling and analysis of timed systems (FORMATS'03). LNCS, vol 2791. Springer, Berlin, pp 88-104 (Pubitemid 38716865)
    • (2003) Lecture Notes in Computer Science , Issue.2791 , pp. 88-104
    • Andova, S.1    Hermanns, H.2    Katoen, J.-P.3
  • 8
    • 21844505024 scopus 로고
    • Model Checking of Probabilistic and Nondeterministic Systems
    • Foundations of Software Technology and Theoretical Computer Science
    • Bianco A, de Alfaro L (1995) Model checking of probabilistic and nondeterministic systems. In: Thiagarajan P (ed) Proc of the 15th conference on foundations of software technology and theoretical computer science (FSTTCS'95). LNCS, vol 1026. Springer, Berlin, pp 499-513 (Pubitemid 126012732)
    • (1995) Lecture Notes in Computer Science , Issue.1026 , pp. 499-513
    • Bianco, A.1    De Alfaro, L.2
  • 10
    • 67651174731 scopus 로고    scopus 로고
    • What agents can probably enforce
    • 2544008 1191.68648
    • Bulling N, Jamroga W (2009) What agents can probably enforce. Fundam Inform 93(1-3):81-96
    • (2009) Fundam Inform , vol.93 , Issue.1-3 , pp. 81-96
    • Bulling, N.1    Jamroga, W.2
  • 12
  • 18
    • 44049103684 scopus 로고    scopus 로고
    • Probabilistic alternating-time temporal logic and model checking algorithm
    • DOI 10.1109/FSKD.2007.458, 4406041, Proceedings - Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007
    • Chen T, Lu J (2007) Probabilistic alternating-time temporal logic and model checking algorithm. In: Proc of the 4th international conference on fuzzy systems and knowledge discovery (FSKD'07). IEEE Press, New York, pp 35-39 (Pubitemid 351710709)
    • (2007) Proceedings - Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007 , vol.2 , pp. 35-39
    • Chen, T.1    Lu, J.2
  • 19
    • 0012348982 scopus 로고
    • On algorithms for simple stochastic games
    • DIMACS series in discrete mathematics and theoretical computer science 13
    • Condon A (1993) On algorithms for simple stochastic games. In: Advances in computational complexity theory. DIMACS series in discrete mathematics and theoretical computer science, vol 13, pp 51-73
    • (1993) Advances in Computational Complexity Theory , pp. 51-73
    • Condon, A.1
  • 20
    • 84976740260 scopus 로고
    • The complexity of probabilistic verification
    • 1411788 0885.68109 10.1145/210332.210339
    • Courcoubetis C, Yannakakis M (1995) The complexity of probabilistic verification. J ACM 42(4):857-907
    • (1995) J ACM , vol.42 , Issue.4 , pp. 857-907
    • Courcoubetis, C.1    Yannakakis, M.2
  • 21
    • 84888230117 scopus 로고    scopus 로고
    • Computing minimum and maximum reachability times in probabilistic systems
    • J. Baeten S. Mauw (eds) LNCS 1664 Springer Berlin 10.1007/3-540-48320-9-7
    • de Alfaro L (1999) Computing minimum and maximum reachability times in probabilistic systems. In: Baeten J, Mauw S (eds) Proc of the 10th international conference on concurrency theory (CONCUR'99). LNCS, vol 1664. Springer, Berlin, pp 66-81
    • (1999) Proc of the 10th International Conference on Concurrency Theory (CONCUR'99) , pp. 66-81
    • De Alfaro, L.1
  • 24
    • 79959282379 scopus 로고    scopus 로고
    • Automated verification techniques for probabilistic systems
    • M. Bernardo V. Issarny (eds) LNCS 6659 Springer Berlin 10.1007/978-3-642-21455-4-3
    • Forejt V, Kwiatkowska M, Norman G, Parker D (2011) Automated verification techniques for probabilistic systems. In: Bernardo M, Issarny V (eds) Formal methods for eternal networked software systems (SFM'11). LNCS, vol 6659. Springer, Berlin, pp 53-113
    • (2011) Formal Methods for Eternal Networked Software Systems (SFM'11) , pp. 53-113
    • Forejt, V.1    Kwiatkowska, M.2    Norman, G.3    Parker, D.4
  • 25
    • 0003096318 scopus 로고
    • A logic for reasoning about time and reliability
    • 0820.68113 10.1007/BF01211866
    • Hansson H, Jonsson B (1994) A logic for reasoning about time and reliability. Form Asp Comput 6(5):512-535
    • (1994) Form Asp Comput , vol.6 , Issue.5 , pp. 512-535
    • Hansson, H.1    Jonsson, B.2
  • 27
    • 0037937457 scopus 로고    scopus 로고
    • A game-based verification of non-repudiation and fair exchange protocols
    • Kremer S, Raskin J-F (2003) A game-based verification of non-repudiation and fair exchange protocols. J Comput Secur 11(3):399-430
    • (2003) J Comput Secur , vol.11 , Issue.3 , pp. 399-430
    • Kremer, S.1    Raskin, J.-F.2
  • 31
    • 0032281306 scopus 로고    scopus 로고
    • The determinacy of blackwell games
    • Martin D (1998) The determinacy of Blackwell games. J Symb Log 63(4):1565-1581 (Pubitemid 128338401)
    • (1998) Journal of Symbolic Logic , vol.63 , Issue.4 , pp. 1565-1581
    • Martin, D.A.1
  • 32
    • 33846576007 scopus 로고    scopus 로고
    • Results on the quantitative μ-calculus qMμ
    • DOI 10.1145/1182613.1182616
    • McIver A, Morgan C (2007) Results on the quantitative mu-calculus qMu. ACM Trans Comput Log 8(1). doi: 10.1145/1182613.1182616 (Pubitemid 46174047)
    • (2007) ACM Transactions on Computational Logic , vol.8 , Issue.1 , pp. 3
    • McIver, A.1    Morgan, C.2
  • 33
    • 84862075638 scopus 로고    scopus 로고
    • Host selection through collective decision
    • doi: 10.1145/2168260.2168264
    • Saffre F, Simaitis A (2012) Host selection through collective decision. ACM Trans Auton Adapt Syst 7(1). doi: 10.1145/2168260.2168264
    • (2012) ACM Trans Auton Adapt Syst , vol.7 , Issue.1
    • Saffre, F.1    Simaitis, A.2
  • 36
    • 0042261185 scopus 로고    scopus 로고
    • Model checking cooperation, knowledge, and time - A case study
    • DOI 10.1016/S1090-9443(03)00031-0
    • van der Hoek W, Wooldridge M (2003) Model checking cooperation, knowledge, and time - a case study. Res Econ 57(3):235-265 (Pubitemid 37083788)
    • (2003) Research in Economics , vol.57 , Issue.3 , pp. 235-265
    • Van Der Hoek, W.1    Wooldridge, M.2
  • 37
    • 84880704683 scopus 로고    scopus 로고
    • On probabilistic alternating simulations
    • C. Calude V. Sassone (eds) IFIP 323 Springer Berlin 10.1007/978-3-642- 15240-5-6
    • Zhang C, Pang J (2010) On probabilistic alternating simulations. In: Calude C, Sassone V (eds) Proc of the 6th IFIP conference on theoretical computer science (TCS'10). IFIP, vol 323. Springer, Berlin, pp 71-85
    • (2010) Proc of the 6th IFIP Conference on Theoretical Computer Science (TCS'10) , pp. 71-85
    • Zhang, C.1    Pang, J.2
  • 38
    • 84862933670 scopus 로고    scopus 로고
    • An algorithm for probabilistic alternating simulation
    • M. Bieliková G. Friedrich G. Gottlob S. Katzenbeisser G. Turán (eds) LNCS 7147 Springer Berlin
    • Zhang C, Pang J (2012) An algorithm for probabilistic alternating simulation. In: Bieliková M, Friedrich G, Gottlob G, Katzenbeisser S, Turán G (eds) Proc of the 38th conference on current trends in theory and practice of computer science (SOFSEM'12). LNCS, vol 7147. Springer, Berlin, pp 431-442
    • (2012) Proc of the 38th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'12) , pp. 431-442
    • Zhang, C.1    Pang, J.2


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