메뉴 건너뛰기




Volumn 42, Issue 2, 2000, Pages 201-210

Succinctness Gap between Monadic Logic and Duration Calculus

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0347603299     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-2000-42204     Document Type: Article
Times cited : (2)

References (15)
  • 1
    • 0001540660 scopus 로고    scopus 로고
    • Duration Calculus: Logical Foundations
    • Zhou Chaochen and M. Hansen. Duration Calculus: Logical Foundations. In Formal Aspects of Computing, 9:283-330, 1997.
    • (1997) Formal Aspects of Computing , vol.9 , pp. 283-330
    • Zhou, C.1    Hansen, M.2
  • 4
    • 0023033565 scopus 로고
    • A propositional modal logic of time intervals
    • J. Halperin, B. Moszkowski and Z. Manna. A propositional modal logic of time intervals. In LICS, 1986, pp. 279-292.
    • (1986) LICS , pp. 279-292
    • Halperin, J.1    Moszkowski, B.2    Manna, Z.3
  • 7
    • 84957625979 scopus 로고
    • Some extensions to Propositional Mean Value Calculus: Expressiveness and Decidability
    • LNCS
    • P. Pandya. Some extensions to Propositional Mean Value Calculus: Expressiveness and Decidability. In Proceedings of Computer Science Logic 1995, LNCS vol. 1092, 1995.
    • (1995) Proceedings of Computer Science Logic 1995 , vol.1092
    • Pandya, P.1
  • 8
    • 18944383086 scopus 로고    scopus 로고
    • On expressive completeness of Duration and Mean Value Calculi
    • Electronic Notes in Theoretical Computer Science
    • A. Rabinovich. On expressive completeness of Duration and Mean Value Calculi. In Proceedings of EXPRESS, Electronic Notes in Theoretical Computer Science, Vol. 7, 1997.
    • (1997) Proceedings of EXPRESS , vol.7
    • Rabinovich, A.1
  • 9
    • 0013316259 scopus 로고    scopus 로고
    • Non-elementary Lower Bound for Propositional Duration Calculus
    • A. Rabinovich. Non-elementary Lower Bound for Propositional Duration Calculus. Information Processing Letters 66 (1998), 7-11.
    • (1998) Information Processing Letters , vol.66 , pp. 7-11
    • Rabinovich, A.1
  • 10
    • 0032180683 scopus 로고    scopus 로고
    • On the Decidability of Continuous Time Specification Formalisms
    • A. Rabinovich. On the Decidability of Continuous Time Specification Formalisms. Journal of Logic and Computation, Vol. 8, No 5, pp 669-678, 1998.
    • (1998) Journal of Logic and Computation , vol.8 , Issue.5 , pp. 669-678
    • Rabinovich, A.1
  • 11
    • 0034627948 scopus 로고    scopus 로고
    • Expressive Completeness of Duration Calculus
    • A. Rabinovich. Expressive Completeness of Duration Calculus. Information and Computation, Vol. 156, No. 1/2, pp. 320-344, 2000.
    • (2000) Information and Computation , vol.156 , Issue.1-2 , pp. 320-344
    • Rabinovich, A.1
  • 13
    • 0022092438 scopus 로고
    • The complexity of propositional linear temporal logics
    • A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. J. ACM 32(3):733-749, 1985
    • (1985) J. ACM , vol.32 , Issue.3 , pp. 733-749
    • Sistla, A.P.1    Clarke, E.M.2


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