메뉴 건너뛰기




Volumn 32, Issue 7, 2006, Pages 510-526

TCTL inevitability analysis of dense-time systems: From theory to engineering

Author keywords

Abstraction; Greatest fixpoint; Inevitability; Model checking; non Zeno; Real time systems; TCTL

Indexed keywords

GREATEST FIXPOINTS; INEVITABILITY ANALYSIS;

EID: 33947108848     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.2006.71     Document Type: Article
Times cited : (17)

References (36)
  • 4
    • 0030384792 scopus 로고    scopus 로고
    • Approximate Reachability Analysis of Timed Automata
    • F. Balarin, "Approximate Reachability Analysis of Timed Automata," Proc. IEEE Real-Time Systems Symp., pp. 52-61, 1996.
    • (1996) Proc. IEEE Real-Time Systems Symp , pp. 52-61
    • Balarin, F.1
  • 7
    • 0004457207 scopus 로고    scopus 로고
    • A Quantitative Approach to the Formal Verification of Real-Time Systems,
    • PhD Thesis, Carnegie Mellon Univ
    • S.V. Campos, "A Quantitative Approach to the Formal Verification of Real-Time Systems," PhD Thesis, Carnegie Mellon Univ., 1996.
    • (1996)
    • Campos, S.V.1
  • 9
    • 0000911801 scopus 로고
    • Abstract Interpretation and Application to Logic Programs
    • P. Cousot and R. Cousot, "Abstract Interpretation and Application to Logic Programs," J. Logic Programming, vol. 13, no. 2-3, pp. 103-179, 1992.
    • (1992) J. Logic Programming , vol.13 , Issue.2-3 , pp. 103-179
    • Cousot, P.1    Cousot, R.2
  • 10
    • 0022706656 scopus 로고
    • Automatic Verification of Finite-State Concurrent Systems Using Temporal-Logic Specifications
    • E.M. Clarke, E.A. Emerson, and A.P. Sistla, "Automatic Verification of Finite-State Concurrent Systems Using Temporal-Logic Specifications," ACM Trans. Programming Languages and Systems, vol. 8, no. 2, pp. 244-263, 1986.
    • (1986) ACM Trans. Programming Languages and Systems , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3
  • 14
    • 0023108525 scopus 로고
    • Uniform Inevitability Is Tree Automation Ineffable
    • E.A. Emerson, "Uniform Inevitability Is Tree Automation Ineffable," Information Processing Letters, vol. 24, no. 2, pp. 77-79, 1987.
    • (1987) Information Processing Letters , vol.24 , Issue.2 , pp. 77-79
    • Emerson, E.A.1
  • 15
    • 0027110272 scopus 로고
    • Dines-Fourier-Motzkin Quantifier Elimination and an Application of Corresponding Transfer Principles over Ordered Fields
    • B.C. Eaves and U.G. Rothblum, "Dines-Fourier-Motzkin Quantifier Elimination and an Application of Corresponding Transfer Principles over Ordered Fields," Math. Programming, vol. 53, no. 3, pp. 307-321, 1992.
    • (1992) Math. Programming , vol.53 , Issue.3 , pp. 307-321
    • Eaves, B.C.1    Rothblum, U.G.2
  • 16
    • 4444252974 scopus 로고    scopus 로고
    • Bluetooth Baseband Specification, version 1.0
    • J. Haartsen, "Bluetooth Baseband Specification, version 1.0," http://www.bluetooth.com/, 2006.
    • (2006)
    • Haartsen, J.1
  • 21
    • 18944401757 scopus 로고    scopus 로고
    • Parking Can Get You There Faster-Model Augmentation to Speed Up Real-Time Model Checking
    • M.O. Moller, "Parking Can Get You There Faster-Model Augmentation to Speed Up Real-Time Model Checking," Electronic Notes in Theoretical Computer Science, vol. 65, no. 6, 2002.
    • (2002) Electronic Notes in Theoretical Computer Science , vol.65 , Issue.6
    • Moller, M.O.1
  • 27
    • 0034513970 scopus 로고    scopus 로고
    • F. Wang, Region Encoding Diagram for Fully Symbolic Verification of Real-Time Systems, Proc. 24th IEEE Computer Software and Applications Conf, pp. 509-515, 2000
    • F. Wang, "Region Encoding Diagram for Fully Symbolic Verification of Real-Time Systems," Proc. 24th IEEE Computer Software and Applications Conf., pp. 509-515, 2000.
  • 28
    • 33947114627 scopus 로고    scopus 로고
    • F. Wang, RED: Model-Checker for Timed Automata with Clock-Restriction Diagram, Proc. Workshop Real-Time Tools, Technical Report 2001-014, Dept. of Information Technology, Uppsala Univ., Aug. 2001.
    • F. Wang, "RED: Model-Checker for Timed Automata with Clock-Restriction Diagram," Proc. Workshop Real-Time Tools, Technical Report 2001-014, Dept. of Information Technology, Uppsala Univ., Aug. 2001.
  • 32
    • 0036158371 scopus 로고    scopus 로고
    • Efficient and User-Friendly Verification
    • Jan
    • F. Wang and P.-A. Hsiung, "Efficient and User-Friendly Verification," IEEE Trans. Computers, vol. 51, no. 1, pp. 61-83, Jan. 2002.
    • (2002) IEEE Trans. Computers , vol.51 , Issue.1 , pp. 61-83
    • Wang, F.1    Hsiung, P.-A.2
  • 35
    • 3543085150 scopus 로고
    • Symbolic Approximations for Verifying Real-Time Systems,
    • PhD thesis, Stanford Univ
    • H. Wong-Toi, "Symbolic Approximations for Verifying Real-Time Systems," PhD thesis, Stanford Univ., 1995.
    • (1995)
    • Wong-Toi, H.1


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