메뉴 건너뛰기




Volumn 863 LNCS, Issue , 1994, Pages 694-715

Specifying timed state sequences in powerful decidable logics and timed automata

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; FAULT TOLERANCE; FORMAL LANGUAGES;

EID: 85005984698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58468-4_191     Document Type: Conference Paper
Times cited : (114)

References (26)
  • 3
    • 0000050873 scopus 로고
    • Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
    • R. L. GROSSMAN, A. NERODE, A. P. RAVN, AND H. RISCHEL, editors, Springer-Verlag, Berlin
    • R. ALUR, C. COURCOUBETIS, T.A. HENZINGER, AND P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In R. L. GROSSMAN, A. NERODE, A. P. RAVN, AND H. RISCHEL, editors, “Hybrid Systems“, vol. 736 of”Lecture Notes in Computer Science”. Springer-Verlag, Berlin (1993).
    • (1993) Hybrid Systems“, Vol. 736 Oflecture Notes in Computer Science”
    • Alur, R.1    Courcoubetis, C.2    Henzinger, T.A.3    Ho, P.-H.4
  • 4
    • 0028413052 scopus 로고
    • A theory of timed automata
    • R. ALUR and D. DILL. A theory of timed automata. Theoret. Comput. Sci. 126 (2), 183-235 (1994).
    • (1994) Theoret. Comput. Sci , vol.126 , Issue.2 , pp. 183-235
    • Alur, R.1    Dill, D.2
  • 5
    • 85031771187 scopus 로고
    • Automata for modeling real-time systems
    • In M. S. PATERSON, editor, of”Lecture Notes in Computer Science”, Warwick, England , European Assoc. Theoret. Comput. Sci., Springer-Verlag
    • R. ALUR and D. L. DILL. Automata for modeling real-time systems. In M. S. PATERSON, editor, “Automata, Languages and Programming: 17th International Colloquium“, vol. 443 of”Lecture Notes in Computer Science”, pp. 322-335, Warwick, England (1990). European Assoc. Theoret. Comput. Sci., Springer-Verlag.
    • (1990) “Automata, Languages and Programming: 17Th International Colloquium“ , vol.443 , pp. 322-335
    • Alur, R.1    Dill, D.L.2
  • 8
    • 0025658607 scopus 로고
    • Real-time logics: Complexity and expressiveness
    • Philadelphia, Pennsylvania , IEEE Computer Society Press
    • R. ALUR and T. HENZINGER. Real-time logics: complexity and expressiveness. In “Fifth Annual IEEE Symposium on Logic in Computer Science”, pp. 390-401, Philadelphia, Pennsylvania (1990). IEEE Computer Society Press.
    • (1990) Fifth Annual IEEE Symposium on Logic in Computer Science , pp. 390-401
    • Alur, R.1    Henzinger, T.2
  • 9
    • 0001775707 scopus 로고
    • Logics and models of real-time: A survey
    • In J. W. DE BAKKER, C. HUIZING, W. DE ROEVER, AND C. R.OZENBERG, editors, ”Lecture Notes in Computer Science”, Mook, The Netherlands, Springer-Verlag
    • R. ALtm and T. A. HENZINGER. Logics and models of real-time: a survey. In J. W. DE BAKKER, C. HUIZING, W. DE ROEVER, AND C. R.OZENBERG, editors, “Real-Time: Theory in Practice“, vol. 600 of ”Lecture Notes in Computer Science”, pp. 74-106, Mook, The Netherlands (1991). Springer-Verlag.
    • (1991) “Real-Time: Theory in Practice“ , vol.600 , pp. 74-106
    • Altm, R.1    Henzinger, T.A.2
  • 10
    • 85031724032 scopus 로고
    • Back to the future: Towards a theory of timed regular languages
    • Pittsburgh, Pennsylvania, IEEE Computer Society Press
    • R. ALUR and T. A. HENZINGER. Back to the future: towards a theory of timed regular languages. In “33rd Annual Symposium on Foundations of Computer Science”, pp. 177-186, Pittsburgh, Pennsylvania (1992). IEEE Computer Society Press.
    • (1992) 33Rd Annual Symposium on Foundations of Computer Science , pp. 177-186
    • Alur, R.1    Henzinger, T.A.2
  • 11
    • 43949167687 scopus 로고
    • Real-time logics: Complexity and expressiveness
    • R. ALUR and T. A. HENZINGER. Real-time logics: complexity and expressiveness. Inform. and Control 104 (1), 35-77 (1993).
    • (1993) Inform. and Control , vol.104 , Issue.1 , pp. 35-77
    • Alur, R.1    Henzinger, T.A.2
  • 13
    • 0002921593 scopus 로고
    • On a decision method in restricted second-order arithmetic
    • E. NAGEL, P. SUPPES, AND A. TARSKI, editors, Stanford University Press
    • J. R. BÜCHI. On a decision method in restricted second-order arithmetic. In E. NAGEL, P. SUPPES, AND A. TARSKI, editors, “Logic, Methodology, and Philosophy of Science: Proc. of the 1960 International Congress“, pp. 1-11. Stanford University Press (1962).
    • (1962) , pp. 1-11
    • Büchi, J.R.1
  • 14
    • 84947796708 scopus 로고
    • Decidability of bisimulation equivalences for parallel timer processes
    • In G. v. BOCHMANN AND D. K. PROBST, editors, ”Lecture Notes in Computer Science”, Montreal, Canada , Springer-Verlag
    • K. Cerans Decidability of bisimulation equivalences for parallel timer processes. In G. v. BOCHMANN AND D. K. PROBST, editors, “Computer Aided Verification, Fourth International Workshop, CAV '92”, vol. 663 of”Lecture Notes in Computer Science”, pp. 302-315, Montreal, Canada (1992). Springer-Verlag.
    • (1992) Computer Aided Verification, Fourth International Workshop, CAV '92 , vol.663 , pp. 302-315
    • Cerans, K.1
  • 16
    • 0041507909 scopus 로고
    • Logical definability on infinite traces
    • In A. LINGAS, P~. KARLSSON, AND S. CARLSSON, editors, ”Lecture Notes in Computer Science”, Lund, Sweden , European Assoc. Theoret. Cornput. Sci., Springer-Verlag
    • W. EBINGER and A. MUSCHOLL. Logical definability on infinite traces. In A. LINGAS, P~. KARLSSON, AND S. CARLSSON, editors, “Automata, Languages and Programming: 20th International Colloquium“, vol. 700 of”Lecture Notes in Computer Science”, pp. 335-346, Lund, Sweden (1993). European Assoc. Theoret. Cornput. Sci., Springer-Verlag.
    • (1993) “Automata, Languages and Programming: 20Th International Colloquium“ , vol.700 , pp. 335-346
    • Ebinger, W.1    Muscholl, A.2
  • 17
    • 85029884473 scopus 로고
    • Timed transition systems
    • In J. W. DE BAKKER, C. HUIZING, W. DE ROEVER, AND G. ROZENBERG, editors, ”Lecture Notes in Computer Science”, Mook, The Netherlands, Springer-Verlag
    • T. A. HENZINGER, Z. MANNA, and A. PNUELI. Timed transition systems. In J. W. DE BAKKER, C. HUIZING, W. DE ROEVER, AND G. ROZENBERG, editors, “Real-Time: Theory in Practice“, vol. 600 of ”Lecture Notes in Computer Science”, pp. 226-251, Mook, The Netherlands (1991). Springer-Verlag.
    • (1991) “Real-Time: Theory in Practice“ , vol.600 , pp. 226-251
    • Henzinger, T.A.1    Manna, Z.2    Pnueli, A.3
  • 19
    • 0025659998 scopus 로고
    • A logic of concrete time intervals
    • Philadelphia, Pennsylvania, IEEE Computer Society Press
    • H. R. LEwis: A logic of concrete time intervals. In “Fifth Annual IEEE Symposium on Logic in Computer Science”, pp. 380-389, Philadelphia, Pennsylvania (1990). IEEE Computer Society Press.
    • (1990) Fifth Annual IEEE Symposium on Logic in Computer Science , pp. 380-389
    • Lewis, H.R.1
  • 20
    • 21344499324 scopus 로고
    • Models for reactivity
    • Z. MANNA and A. PNUELI. Models for reactivity. Acta Informatica 30 (2), 609-678 (Oct. 1993).
    • (1993) Acta Informatica , vol.30 , Issue.2 , pp. 609-678
    • Manna, Z.1    Pnueli, A.2
  • 21
    • 0009791320 scopus 로고
    • Timed and hybrid statecharts and their textual representation
    • In J. VYTOPIL, editor, ”Lecture Notes in Computer Science”,, Nijmegen, The Netherlands , Springer-Verlag
    • A. PNUELI and Y. KESTEN. Timed and hybrid statecharts and their textual representation. In J. VYTOPIL, editor, “Formal Techniques in Real-time and Faulttolerant Systems: Second International Symposium, Nijmegen, The Netherlands“, vol. 571 of”Lecture Notes in Computer Science”, pp. 591-620, Nijmegen, The Netherlands (Jan. 1992). Springer-Verlag.
    • (1992) “Formal Techniques in Real-Time and Faulttolerant Systems: Second International Symposium, Nijmegen, the Netherlands“ , vol.571 , pp. 591-620
    • Pnueli, A.1    Kesten, Y.2
  • 22
    • 84968501436 scopus 로고
    • Decidability of second-order theories and finite automata on infinite trees
    • M. O. RABIN. Decidability of second-order theories and finite automata on infinite trees. Trans. Amer. Math. Soc. 141, 1-35 (1969).
    • (1969) Trans. Amer. Math. Soc , vol.141 , pp. 1-35
    • Rabin, M.O.1
  • 23
    • 0002614970 scopus 로고
    • Generalized finite automata theory with an application to a decision problem of second-order arithmetic
    • J. W. THATCHER and J. B. WRIGHT. Generalized finite automata theory with an application to a decision problem of second-order arithmetic. Math. Systems Theory 2 (1), 57-81 (1968).
    • (1968) Math. Systems Theory , vol.2 , Issue.1 , pp. 57-81
    • Thatcher, J.W.1    Wright, J.B.2
  • 24
    • 85026874372 scopus 로고
    • Technical Report 9407, Christian-Albrechts-Universits zu Kiel, Institut ffir Informatik und Praktische Mathematik (July
    • TH. WOLPER. Automaten und Logiken zur Beschreibung zeitabhtngiger Systeme. Technical Report 9407, Christian-Albrechts-Universits zu Kiel, Institut ffir Informatik und Praktische Mathematik (July 1994).
    • (1994) Automaten Und Logiken Zur Beschreibung Zeitabhtngiger Systeme.
    • Wolper, T.H.1
  • 25
    • 0020496645 scopus 로고
    • Temporal logic can be more expressive
    • P. WOLPER. Temporal logic can be more expressive, Inform, and Control 56, 72-99 (1983).
    • (1983) Inform, and Control , vol.56 , pp. 72-99
    • Wolper, P.1


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