메뉴 건너뛰기




Volumn 1770, Issue , 2000, Pages 13-34

A classification of symbolic transition systems

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; HYBRID SYSTEMS; TEMPORAL LOGIC;

EID: 84944043632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_2     Document Type: Conference Paper
Times cited : (23)

References (19)
  • 4
    • 1542265614 scopus 로고    scopus 로고
    • Computer-aided Verification: An Introduction to Model Building and Model Checking for Concurrent Systems
    • R. Alur and T.A. Henzinger. Computer-aided Verification: An Introduction to Model Building and Model Checking for Concurrent Systems. Draft, 1998.
    • (1998) Draft
    • Alur, R.1    Henzinger, T.A.2
  • 7
    • 84944382587 scopus 로고
    • Minimal model generation
    • Lecture Notes in Computer Science 531, Springer-Verlag
    • Bouajjani, J.-C. Fernandez, and N. Halbwachs. Minimal model generation. In CAV 90: Computer-aided Verification, Lecture Notes in Computer Science 531, pages 197-203. Springer-Verlag, 1990.
    • (1990) CAV 90: Computer-Aided Verification , pp. 197-203
    • Bouajjanifernandez, J.-C.1    Halbwachs, N.2
  • 8
    • 0028420232 scopus 로고
    • CTL* and ECTL* as fragments of the modal μ-calculus
    • M. Dam. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Computer Science, 126:77-96, 1994.
    • (1994) Theoretical Computer Science , vol.126 , pp. 77-96
    • Dam, M.1
  • 9
    • 84957813927 scopus 로고
    • On model checking for fragments of μ-calculus
    • Lecture Notes in Computer Science 697, Springer-Verlag
    • E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model checking for fragments of μ-calculus. In CAV 93: Computer-aided Verification, Lecture Notes in Computer Science 697, pages 385-396. Springer-Verlag, 1993.
    • (1993) CAV 93: Computer-Aided Verification , pp. 385-396
    • Emerson, E.A.1    Jutla, C.S.2    Sistla, A.P.3
  • 11
    • 84958045872 scopus 로고
    • Hybrid automata with finite bisimulations
    • Lecture Notes in Computer Science 944, Springer-Verlag
    • T.A. Henzinger. Hybrid automata with finite bisimulations. In ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pages 324-335. Springer-Verlag, 1995.
    • (1995) ICALP 95: Automata, Languages, and Programming , pp. 324-335
    • Henzinger, T.A.1
  • 15
    • 84955588655 scopus 로고    scopus 로고
    • State equivalences for rectangular hybrid au- tomata
    • Lecture Notes in Computer Science 1119, Springer-Verlag
    • T.A. Henzinger and P.W. Kopke. State equivalences for rectangular hybrid au- tomata. In CONCUR 96: Concurrency Theory, Lecture Notes in Computer Science 1119, pages 530-545. Springer-Verlag, 1996.
    • (1996) CONCUR 96: Concurrency Theory , pp. 530-545
    • Henzinger, T.A.1    Kopke, P.W.2
  • 18
    • 0025432462 scopus 로고
    • CCS expressions, finite-state processes, and three problems of equivalence
    • P.C. Kanellakis and S.A. Smolka. CCS expressions, finite-state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
    • (1990) Information and Computation , vol.86 , pp. 43-68
    • Kanellakis, P.C.1    Smolka, S.A.2


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