메뉴 건너뛰기




Volumn , Issue , 2004, Pages 114-121

Decidability results for parametric probabilistic transition systems with an application to security

Author keywords

[No Author keywords available]

Indexed keywords

NON-REPUDIATION PROTOCOLS; PARAMETRIC PROBABILISTIC TRANSITION SYSTEMS; PARAMETRIC REPRESENTATION; REPUDIATION PROTOCOLS;

EID: 16244416561     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2004.1347512     Document Type: Conference Paper
Times cited : (7)

References (21)
  • 1
    • 84943242087 scopus 로고    scopus 로고
    • Security analysis of a probabilistic non-repudiation protocol
    • Proc. of PAPM-PROBMIV'02, Springer
    • A. Aldini, and R. Gorrieri, "Security Analysis of a Probabilistic Non-repudiation Protocol", In Proc. of PAPM-PROBMIV'02, Springer LNCS 2399, 2002, 17-36.
    • (2002) LNCS , vol.2399 , pp. 17-36
    • Aldini, A.1    Gorrieri, R.2
  • 2
    • 85026746060 scopus 로고    scopus 로고
    • How to specify and verify the longrun average behaviour of probabilistic systems
    • IEEE Press
    • L. de Alfaro, "How to specify and verify the longrun average behaviour of probabilistic systems", In Proc. of LICS'98, IEEE Press, 1998, 454-465.
    • (1998) Proc. of LICS'98 , pp. 454-465
    • De Alfaro, L.1
  • 3
    • 84888230117 scopus 로고    scopus 로고
    • Computing minimum and maximum reachability times in probabilistic systems
    • Proc. of CONCUR'99, Springer
    • L. de Alfaro, "Computing minimum and maximum reachability times in probabilistic systems", In Proc. of CONCUR'99, Springer LNCS 1664, 1999, 66-81.
    • (1999) LNCS , vol.1664 , pp. 66-81
    • De Alfaro, L.1
  • 4
    • 58149326570 scopus 로고
    • Axiomatizing probabilistic processes: ACP with generative probabilities
    • J. C. M. Baeten, J. A. Bergstra, and S. A. Smolka, "Axiomatizing probabilistic processes: ACP with generative probabilities", Information and Computation, 121, 1995, 234-255.
    • (1995) Information and Computation , vol.121 , pp. 234-255
    • Baeten, J.C.M.1    Bergstra, J.A.2    Smolka, S.A.3
  • 5
    • 0032048230 scopus 로고    scopus 로고
    • On the verification of qualitative properties of probabilistic processes under fairness constraints
    • C. Baier, and M. Kwiatkowska, "On the verification of qualitative properties of probabilistic processes under fairness constraints", Information Processing Letters, 66, 1998, 71-79.
    • (1998) Information Processing Letters , vol.66 , pp. 71-79
    • Baier, C.1    Kwiatkowska, M.2
  • 6
    • 0032131465 scopus 로고    scopus 로고
    • Model checking for probabilistic time logic with fairness
    • C. Baier, and M. Kwiatkowska, "Model checking for probabilistic time logic with fairness", Distributed Computing, 11, 1998, 125-155.
    • (1998) Distributed Computing , vol.11 , pp. 125-155
    • Baier, C.1    Kwiatkowska, M.2
  • 7
    • 0036502999 scopus 로고    scopus 로고
    • Markov decision processes and buchi automata
    • D. Beauquier, "Markov Decision Processes and Buchi Automata", Fundamenta. Informaticae, 50, 2002, 1-13.
    • (2002) Fundamenta. Informaticae , vol.50 , pp. 1-13
    • Beauquier, D.1
  • 8
    • 21844505024 scopus 로고
    • Model checking of probabilistic and deterministic systems
    • Proc. of 15th Conference on Foundations of Computer Technology and Theoretical Computer Science, Springer
    • A. Bianco, and L. de Alfaro, "Model checking of probabilistic and deterministic systems", In Proc. of 15th Conference on Foundations of Computer Technology and Theoretical Computer Science, Springer LNCS 1026, 1995, 499-513.
    • (1995) LNCS , vol.1026 , pp. 499-513
    • Bianco, A.1    De Alfaro, L.2
  • 9
    • 85027609786 scopus 로고
    • Testing preorders for probabilistic processes
    • Proc. of ICALP'92, Springer
    • R. Cleaveland, S. A. Smolka, and A. Zwarico, "Testing preorders for probabilistic processes", In Proc. of ICALP'92, Springer LNCS 623, 1992, 708-719.
    • (1992) LNCS , vol.623 , pp. 708-719
    • Cleaveland, R.1    Smolka, S.A.2    Zwarico, A.3
  • 10
    • 85022932854 scopus 로고    scopus 로고
    • A logic characterization of bisimulation for Markov processes
    • IEEE Press
    • J. Desharnais, A. Edalat, and P. Panangaden, "A logic characterization of bisimulation for Markov Processes", In Proc. of LICS'98, IEEE Press, 1998, 478-487.
    • (1998) Proc. of LICS'98 , pp. 478-487
    • Desharnais, J.1    Edalat, A.2    Panangaden, P.3
  • 13
    • 0003255290 scopus 로고
    • Time and probability in formal design of distributed systems
    • Elsevier
    • H. H. Hansson, "Time and probability in formal design of distributed systems", Real-time Safety Critical Systems, 1, 1994, Elsevier.
    • (1994) Real-time Safety Critical Systems , vol.1
    • Hansson, H.H.1
  • 14
    • 0026191240 scopus 로고
    • Specification and refinement of probabilistic processes
    • IEEE Press
    • B. Jonsson, and K. Larsen, "Specification and refinement of probabilistic processes", In Proc. of LICS'91, IEEE Press, 1991, 266-277.
    • (1991) Proc. of LICS'91 , pp. 266-277
    • Jonsson, B.1    Larsen, K.2
  • 15
    • 11344249122 scopus 로고    scopus 로고
    • Weak bisimulation for probabilistic timed automata and applications to security
    • IEEE Press
    • R. Lanotte, A. Maggiolo-Schettini, and A. Troina, "Weak Bisimulation for Probabilistic Timed Automata and Applications to Security", In Proc. of SEFM'03, IEEE Press, 2003, 34-43.
    • (2003) Proc. of SEFM'03 , pp. 34-43
    • Lanotte, R.1    Maggiolo-Schettini, A.2    Troina, A.3
  • 16
    • 11344274021 scopus 로고    scopus 로고
    • Automatic analysis of a non-repudiation protocol
    • Elsevier ENTCS, to appear
    • R. Lanotte, A. Maggiolo-Schettini, and A. Troina, "Automatic Analysis of a Non-Repudiation Protocol", In Proc. of QAPL'03, Elsevier ENTCS, to appear.
    • Proc. of QAPL'03
    • Lanotte, R.1    Maggiolo-Schettini, A.2    Troina, A.3
  • 17
    • 0026222347 scopus 로고
    • Bisimulation through probabilistic testing
    • K. Larsen, and A. Skou, "Bisimulation through probabilistic testing", Information and Computation, 94, 1991, 1-28.
    • (1991) Information and Computation , vol.94 , pp. 1-28
    • Larsen, K.1    Skou, A.2
  • 18
    • 0142043248 scopus 로고
    • A decomposition theorem for probabilistic transition systems
    • O. Maler, "A decomposition theorem for probabilistic transition systems", Theoretical Computer Science, 145, 1995, 391-396.
    • (1995) Theoretical Computer Science , vol.145 , pp. 391-396
    • Maler, O.1
  • 20
    • 85010330309 scopus 로고    scopus 로고
    • Compositional analysis of expected delays in networks of probabilistic I/O automata
    • IEEE Press
    • E. Stark, and S. A. Smolka, "Compositional analysis of expected delays in networks of probabilistic I/O automata", In Proc. of LICS 98, IEEE Press, 1998, 466-477.
    • (1998) Proc. of LICS 98 , pp. 466-477
    • Stark, E.1    Smolka, S.A.2
  • 21
    • 0031125422 scopus 로고    scopus 로고
    • Composition and behaviors of probabilistic I/O automata
    • S. H. Wu, S. A. Smolka, and E. Stark, "Composition and behaviors of probabilistic I/O automata", Theoretical Computer Science, 176, 1997, 1-38.
    • (1997) Theoretical Computer Science , vol.176 , pp. 1-38
    • Wu, S.H.1    Smolka, S.A.2    Stark, E.3


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