메뉴 건너뛰기




Volumn , Issue , 2005, Pages 127-136

Verifying infinite Markov chains with a finite attractor or the global coarseness property

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBABILITY; PROBLEM SOLVING; VECTORS;

EID: 26844442704     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2005.54     Document Type: Conference Paper
Times cited : (12)

References (27)
  • 3
    • 26844526945 scopus 로고    scopus 로고
    • Verifying infinite markov chains with a finite attractor or the global coarseness property
    • Dept. of Information Technology, Uppsala University, Sweden
    • P. A. Abdulla, N. B. Henda, and R. Mayr. Verifying infinite markov chains with a finite attractor or the global coarseness property. Technical report, Dept. of Information Technology, Uppsala University, Sweden, 2005.
    • (2005) Technical Report
    • Abdulla, P.A.1    Henda, N.B.2    Mayr, R.3
  • 4
    • 0002811218 scopus 로고    scopus 로고
    • Verifying programs with unreliable channels
    • P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
    • (1996) Information and Computation , vol.127 , Issue.2 , pp. 91-101
    • Abdulla, P.A.1    Jonsson, B.2
  • 6
    • 84957688217 scopus 로고    scopus 로고
    • Establishing qualitative properties for probabilistic lossy channel systems
    • Katoen, editor, ARTS'99, Formal Methods for Real-Time and Probabilistic Systems, 5th Int. AMAST Workshop. Springer Verlag
    • C. Baier and B. Engelen. Establishing qualitative properties for probabilistic lossy channel systems. In Katoen, editor, ARTS'99, Formal Methods for Real-Time and Probabilistic Systems, 5th Int. AMAST Workshop, volume 1601 of Lecture Notes in Computer Science, pages 34-52. Springer Verlag, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1601 , pp. 34-52
    • Baier, C.1    Engelen, B.2
  • 10
    • 0043162586 scopus 로고
    • On constructing obstruction sets of words
    • June
    • B. Courcelle. On constructing obstruction sets of words. Bulletin of the EATCS, 44:178-185, June 1991.
    • (1991) Bulletin of the EATCS , vol.44 , pp. 178-185
    • Courcelle, B.1
  • 12
    • 84976740260 scopus 로고
    • The complexity of probabilistic verification
    • C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
    • (1995) Journal of the ACM , vol.42 , Issue.4 , pp. 857-907
    • Courcoubetis, C.1    Yannakakis, M.2
  • 13
    • 9444288765 scopus 로고    scopus 로고
    • An optimal automata approach to LTL model checking of probabilistic systems
    • Proc. LPAR'2003
    • J. Couvreur, N. Saheb, and G. Sutre. An optimal automata approach to LTL model checking of probabilistic systems. In Proc. LPAR'2003, volume 2850 of Lecture Notes in Computer Science, pages 361-375, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2850 , pp. 361-375
    • Couvreur, J.1    Saheb, N.2    Sutre, G.3
  • 16
    • 24144446398 scopus 로고    scopus 로고
    • Recursive markov chains, stochastic grammars, and monotone systems of non-linear equations
    • 22nd Int. Symp. on Theoretical Aspects of Computer Science (STACS'05), Springer Verlag
    • K. Etessami and M. Yannakakis. Recursive markov chains, stochastic grammars, and monotone systems of non-linear equations. In 22nd Int. Symp. on Theoretical Aspects of Computer Science (STACS'05), volume 2996 of Lecture Notes in Computer Science. Springer Verlag, 2005.
    • (2005) Lecture Notes in Computer Science , vol.2996
    • Etessami, K.1    Yannakakis, M.2
  • 18
    • 84963086911 scopus 로고
    • Ordering by divisibility in abstract algebras
    • G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc., 2:326-336, 1952.
    • (1952) Proc. London Math. Soc. , vol.2 , pp. 326-336
    • Higman, G.1
  • 20
    • 84956998252 scopus 로고    scopus 로고
    • Probabilistic lossy channel systems
    • TAPSOFT '97: Theory and Practice of Software Development
    • P. Iyer and M. Narasimha. Probabilistic lossy channel systems. In TAPSOFT '97: Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 667-681, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1214 , pp. 667-681
    • Iyer, P.1    Narasimha, M.2
  • 21
    • 0025458835 scopus 로고
    • Decidability of a temporal logic problem for Petri nets
    • P. Jančar. Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science, 74:71-93, 1990.
    • (1990) Theoretical Computer Science , vol.74 , pp. 71-93
    • Jančar, P.1
  • 24
    • 0021474508 scopus 로고
    • An algorithm for the general Petri net reachability problem
    • E. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, 13:441-460, 1984.
    • (1984) SIAM Journal of Computing , vol.13 , pp. 441-460
    • Mayr, E.1
  • 25
    • 21144458576 scopus 로고    scopus 로고
    • Quantitative analysis of probabilistic lossy channel systems
    • th International Colloquium on Automata, Languages, and Programming
    • th International Colloquium on Automata, Languages, and Programming, volume 2719 of Lecture Notes in Computer Science, pages 1008-1021, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2719 , pp. 1008-1021
    • Rabinovich, A.1


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