메뉴 건너뛰기
Proceedings - 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008
Volumn , Issue , 2008, Pages 177-184
Time-abstracting bisimulation for probabilistic timed automata
Author keywords

[No Author keywords available]
Indexed keywords

ABSTRACTING; ARSENIC COMPOUNDS; BOOLEAN FUNCTIONS; REAL TIME SYSTEMS; ROBOTS; SET THEORY; SOFTWARE ENGINEERING; TRANSLATION (LANGUAGES);
EID: 51749111357     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TASE.2008.29     Document Type: Conference Paper
Times cited : (9)
References (12)
  • 1
    • 44949269544 scopus 로고
    • Model-checking in dense real-time
    • R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking in dense real-time. Inf. Comput., 104(1):2-34, 1993.
    • (1993) Inf. Comput , vol.104 , Issue.1 , pp. 2-34
    • Alur, R.1    Courcoubetis, C.2    Dill, D.L.3
  • 2
    • 0028413052 scopus 로고
    • A theory of timed automata
    • R. Alur and D. L. Dill. A theory of timed automata. Theor. Comput. ScL, 126(2):183-235, 1994.
    • (1994) Theor. Comput. ScL , vol.126 , Issue.2 , pp. 183-235
    • Alur, R.1    Dill, D.L.2
  • 3
    • 0034140755 scopus 로고    scopus 로고
    • Deciding bisimilarity and similarity for probabilistic processes
    • C. Baier, B. Engelen, and M. E. Majster-Cederbaum. Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. ScL, 60(1):187-231, 2000.
    • (2000) J. Comput. Syst. ScL , vol.60 , Issue.1 , pp. 187-231
    • Baier, C.1    Engelen, B.2    Majster-Cederbaum, M.E.3
  • 4
    • 21844505024 scopus 로고
    • Model checking of probabilistic and nondeterministic systems
    • A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In FSTTCS, LNCS 1026, pages 499-513, 1995.
    • (1995) FSTTCS, LNCS , vol.1026 , pp. 499-513
    • Bianco, A.1    de Alfaro, L.2
  • 5
    • 0041466320 scopus 로고    scopus 로고
    • Optimal state-space lumping in Markov chains
    • S. Derisavi, H. Hermanns, and W. H. Sanders. Optimal state-space lumping in Markov chains. Inf. Process. Lett., 87(6):309-315, 2003.
    • (2003) Inf. Process. Lett , vol.87 , Issue.6 , pp. 309-315
    • Derisavi, S.1    Hermanns, H.2    Sanders, W.H.3
  • 6
    • 0003096318 scopus 로고    scopus 로고
    • H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Asp. Comput., 6(5):512-535, 1994.
    • H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Asp. Comput., 6(5):512-535, 1994.
  • 7
    • 84896694223 scopus 로고    scopus 로고
    • Probabilistic symbolic model checking with PRISM: A hybrid approach
    • M. Z. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: a hybrid approach. STTT, 6(2):128-142, 2004.
    • (2004) STTT , vol.6 , Issue.2 , pp. 128-142
    • Kwiatkowska, M.Z.1    Norman, G.2    Parker, D.3
  • 8
    • 0037036274 scopus 로고    scopus 로고
    • Automatic verification of real-time systems with discrete probability distributions
    • M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theor. Comput. Sci., 282(1):101-150, 2002.
    • (2002) Theor. Comput. Sci , vol.282 , Issue.1 , pp. 101-150
    • Kwiatkowska, M.Z.1    Norman, G.2    Segala, R.3    Sproston, J.4
  • 9
    • 84862908408 scopus 로고    scopus 로고
    • Symbolic model checking for probabilistic timed automata
    • M. Z. Kwiatkowska, G. Norman, J. Sproston, and F. Wang. Symbolic model checking for probabilistic timed automata. Inf. Comput., 205(7):1027-1077, 2007.
    • (2007) Inf. Comput , vol.205 , Issue.7 , pp. 1027-1077
    • Kwiatkowska, M.Z.1    Norman, G.2    Sproston, J.3    Wang, F.4
  • 10
    • 11344249122 scopus 로고    scopus 로고
    • Weak bisimulation for probabilistic timed automata and applications to security
    • R. Lanotte, A. Maggiolo-Schettini, and A. Troina. Weak bisimulation for probabilistic timed automata and applications to security. In SEFM, pages 34-43, 2003.
    • (2003) SEFM , pp. 34-43
    • Lanotte, R.1    Maggiolo-Schettini, A.2    Troina, A.3
  • 11
    • 0023566630 scopus 로고
    • Three partition refinement algorithms
    • R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6):973-989, 1987.
    • (1987) SIAM J. Comput , vol.16 , Issue.6 , pp. 973-989
    • Paige, R.1    Tarjan, R.E.2
  • 12
    • 0035135204 scopus 로고    scopus 로고
    • Analysis of timed systems using time-abstracting bisimulations
    • S. Tripakis and S. Yovine. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, 18(1):25-68, 2001.
    • (2001) Formal Methods in System Design , vol.18 , Issue.1 , pp. 25-68
    • Tripakis, S.1    Yovine, S.2

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