메뉴 건너뛰기




Volumn 156, Issue 1-2, 2000, Pages 236-263

Specification in CTL + past for verification in CTL

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MATHEMATICAL MODELS; SEMANTICS; SPECIFICATIONS;

EID: 0034627950     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2817     Document Type: Article
Times cited : (42)

References (20)
  • 1
    • 0023326811 scopus 로고
    • Up and down the temporal way
    • Barringer, H. (1987), Up and down the temporal way, Comput. J. 30(2), 134-148.
    • (1987) Comput. J. , vol.30 , Issue.2 , pp. 134-148
    • Barringer, H.1
  • 3
    • 84981282575 scopus 로고
    • Verification tools for finite-state concurrent systems
    • "A Decade of Concurrency, Proc. REX School/Symp., Noordwijkerhout, NL, June 1993," Springer-Verlag, New York/Berlin
    • Clarke, E., Grumberg, O., and Long, D. (1994), Verification tools for finite-state concurrent systems, in "A Decade of Concurrency, Proc. REX School/Symp., Noordwijkerhout, NL, June 1993," Lecture Notes in Computer Science, Vol. 803, pp. 124-175, Springer-Verlag, New York/Berlin.
    • (1994) Lecture Notes in Computer Science , vol.803 , pp. 124-175
    • Clarke, E.1    Grumberg, O.2    Long, D.3
  • 5
    • 78649831891 scopus 로고    scopus 로고
    • The complexity of propositional linear temporal logics in simple cases
    • (extended abstract), "Proc. 15th Ann. Symp. Theoretical Aspects of Computer Science (STACS'98), Paris, France, Feb. 1998," Springer-Verlag, New York/Berlin
    • Demri, S., and Schnoebelen, Ph. (1998), The complexity of propositional linear temporal logics in simple cases (extended abstract), in "Proc. 15th Ann. Symp. Theoretical Aspects of Computer Science (STACS'98), Paris, France, Feb. 1998," Lecture Notes in Computer Science, Vol.1373, pp. 61-72, Springer-Verlag, New York/Berlin.
    • (1998) Lecture Notes in Computer Science , vol.1373 , pp. 61-72
    • Demri, S.1    Schnoebelen, P.2
  • 6
    • 0001449325 scopus 로고
    • Temporal and modal logic
    • J. v. Leeuwen, Ed., Chap. 16, Elsevier Science, New York
    • Emerson, E. A. (1990), Temporal and modal logic, in "Handbook of Theoretical Computer Science" (J. v. Leeuwen, Ed.), Vol. B, Chap. 16, pp. 995-1072, Elsevier Science, New York.
    • (1990) Handbook of Theoretical Computer Science , vol.B , pp. 995-1072
    • Emerson, E.A.1
  • 7
    • 84943223204 scopus 로고
    • The declarative past and imperative future: Executable temporal logic for interactive systems
    • "Proc. Workshop Temporal Logic in Specification, Altrincham, UK, Apr. 1987," Springer-Verlag, New York/Berlin
    • Gabbay, D. (1989), The declarative past and imperative future: Executable temporal logic for interactive systems, in "Proc. Workshop Temporal Logic in Specification, Altrincham, UK, Apr. 1987," Lecture Notes in Computer Science, Vol. 398, pp. 409-448, Springer-Verlag, New York/Berlin.
    • (1989) Lecture Notes in Computer Science , vol.398 , pp. 409-448
    • Gabbay, D.1
  • 8
    • 0000107595 scopus 로고
    • Using temporal logic for prototyping: The design of a lift controller
    • "Proc. Workshop Temporal Logic in Specification, Altrincham, UK, Apr. 1987," Springer-Verlag, New York/Berlin
    • Hale, R. (1989), Using temporal logic for prototyping: The design of a lift controller, in "Proc. Workshop Temporal Logic in Specification, Altrincham, UK, Apr. 1987," Lecture Notes in Computer Science, Vol. 398, pp. 375-408, Springer-Verlag, New York/Berlin.
    • (1989) Lecture Notes in Computer Science , vol.398 , pp. 375-408
    • Hale, R.1
  • 9
    • 22244433643 scopus 로고    scopus 로고
    • personal communication
    • Kupferman, O. (1998), personal communication.
    • (1998)
    • Kupferman, O.1
  • 10
    • 0000325206 scopus 로고    scopus 로고
    • Buy one, get one free!!!
    • Kupferman, O., and Grumberg, O. (1996), Buy one, get one free!!!, J. Logic Comput. 6(4), 523-539.
    • (1996) J. Logic Comput. , vol.6 , Issue.4 , pp. 523-539
    • Kupferman, O.1    Grumberg, O.2
  • 12
    • 0029635432 scopus 로고
    • A hierarchy of temporal logics with past
    • Laroussinie, F., and Schnoebelen, P. (1995), A hierarchy of temporal logics with past, Theoret. Comput. Sci. 148(2), 303-324.
    • (1995) Theoret. Comput. Sci. , vol.148 , Issue.2 , pp. 303-324
    • Laroussinie, F.1    Schnoebelen, P.2
  • 13
    • 85035040046 scopus 로고
    • The glory of the past
    • "Proc. Logics of Programs Workshop, Brooklyn, NY, June 1985," Springer-Verlag, New York/Berlin
    • Lichtenstein, O., Pnueli, A., and Zuck, L. (1985), The glory of the past, in "Proc. Logics of Programs Workshop, Brooklyn, NY, June 1985," Lecture Notes in Computer Science, Vol. 193, pp. 196-218, Springer-Verlag, New York/Berlin.
    • (1985) Lecture Notes in Computer Science , vol.193 , pp. 196-218
    • Lichtenstein, O.1    Pnueli, A.2    Zuck, L.3
  • 14
    • 85034845659 scopus 로고
    • The anchored version of the temporal framework
    • "Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Proc. REX School/Workshop, Noordwijkerhout, NL, May-June 1988," Springer-Verlag, New York/Berlin
    • Manna, Z., and Pnueli, A. (1989), The anchored version of the temporal framework, in "Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Proc. REX School/Workshop, Noordwijkerhout, NL, May-June 1988," Lecture Notes in Computer Science, Vol. 354, pp. 201-284, Springer-Verlag, New York/Berlin.
    • (1989) Lecture Notes in Computer Science , vol.354 , pp. 201-284
    • Manna, Z.1    Pnueli, A.2
  • 20
    • 12244253209 scopus 로고    scopus 로고
    • Technical Report 99-07, Department of Computer Science, RWTH Aachen, Aachen, Germany
    • + Is Exponentially More Succint Than CTL," Technical Report 99-07, Department of Computer Science, RWTH Aachen, Aachen, Germany.
    • (1999) + Is Exponentially More Succint Than CTL
    • Wilke, T.1


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