메뉴 건너뛰기




Volumn 1684, Issue , 1999, Pages 54-89

Automata and their interaction: Definitional suggestions

Author keywords

[No Author keywords available]

Indexed keywords

HYBRID SYSTEMS; SEMANTICS;

EID: 22844457100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_4     Document Type: Conference Paper
Times cited : (8)

References (34)
  • 3
    • 0000655710 scopus 로고
    • Automata for modelling real-time systems
    • Alur, R., Dill, D.: Automata for modelling real-time systems. Proceedings of ICALP90, LNCS 443 (1990) pp. 332-335
    • (1990) Proceedings of ICALP90, LNCS , vol.443 , pp. 332-335
    • Alur, R.1    Dill, D.2
  • 5
    • 51549096502 scopus 로고
    • Logics and models for real time: Theory in practice
    • Alur, R., Henzinger, T.: Logics and models for real time: theory in practice. LNCS 600 (1992) pp. 74-106
    • (1992) LNCS , vol.600 , pp. 74-106
    • Alur, R.1    Henzinger, T.2
  • 6
    • 0000050873 scopus 로고
    • Hybrid automata: Approach to the specification and verification of hybrid systems
    • Alur, A., Courcoubetis, C., Henzinger, T., Pei-Sin, Ho.: Hybrid automata: approach to the specification and verification of hybrid systems. LNCS 736 (1993) pp. 209-229
    • (1993) LNCS , vol.736 , pp. 209-229
    • Alur, A.1    Courcoubetis, C.2    Henzinger, T.3    Pei-Sin, H.4
  • 8
    • 84958041959 scopus 로고    scopus 로고
    • Examples of stabilization with hybrid feedback
    • Artstein, Z.: Examples of stabilization with hybrid feedback. LNCS 1066 (1996) pp. 173-185
    • (1996) LNCS , vol.1066 , pp. 173-185
    • Artstein, Z.1
  • 9
    • 0023246442 scopus 로고
    • Semantics of finite and infinite networks of concurrent communicating agents
    • Broy, M.: Semantics of finite and infinite networks of concurrent communicating agents. Distributed Computing 2 (1987) 13-31
    • (1987) Distributed Computing , vol.2 , pp. 13-31
    • Broy, M.1
  • 12
    • 0022776452 scopus 로고
    • Automatic verification of asynchronous circuits using temporal logic
    • Dill, D., Clarke, E.: Automatic verification of asynchronous circuits using temporal logic. IEEE Proc. 133 (1986) 276-
    • (1986) IEEE Proc , vol.133 , pp. 276
    • Dill, D.1    Clarke, E.2
  • 14
    • 0003241540 scopus 로고
    • Why higher-order logic is a good formalism for specifying and verifying hardware. Formal Aspects of VLSI design
    • Gordon, M.: Why higher-order logic is a good formalism for specifying and verifying hardware. Formal Aspects of VLSI design, Elsevier Science Publ., pp.153-177, 1986
    • (1986) Elsevier Science Publ. , pp. 153-177
    • Gordon, M.1
  • 15
  • 18
    • 84948173788 scopus 로고    scopus 로고
    • Timing analysis of asynchronous circuits using timed automata
    • Maler, O., Pnueli, A.: Timing analysis of asynchronous circuits using timed automata. Proceedings CHARME’95, LNCS 987, pp. 189-205
    • Proceedings CHARME’95, LNCS , vol.987 , pp. 189-205
    • Maler, O.1    Pnueli, A.2
  • 20
    • 21344499324 scopus 로고
    • Models for reactivity
    • Manna, Z., Pnueli, A.: Models for reactivity. Acta Informatica 30 (1993) 609-678.
    • (1993) Acta Informatica , vol.30 , pp. 609-678
    • Manna, Z.1    Pnueli, A.2
  • 21
    • 84910330118 scopus 로고
    • Semantics of concurrent systems: A modular fixed point trace approach
    • Mazurkiewicz, A.: Semantics of concurrent systems: A modular fixed point trace approach. In “Advances in Petri Nets”, LNCS 188, 1984
    • (1984) Advances in Petri Nets, LNCS , vol.188
    • Mazurkiewicz, A.1
  • 28
    • 0009711384 scopus 로고
    • Some definitional suggestions for automata theory
    • Scott, D.: Some definitional suggestions for automata theory. J. of Computer and System Science (1967) 187-212
    • (1967) J. Of Computer and System Science , pp. 187-212
    • Scott, D.1
  • 30
    • 84958050603 scopus 로고    scopus 로고
    • Interconnected Automata and Linear Systems
    • Sontag, E.: Interconnected Automata and Linear Systems. LNCS, No. 1066 (1996) pp. 436-448
    • (1996) LNCS , vol.1066 , pp. 436-448
    • Sontag, E.1
  • 33
    • 84974774413 scopus 로고
    • Compositional proofs for networks of processes
    • Trakhtenbrot, B.A.: Compositional proofs for networks of processes. Funda-menta Informaticae 20(No. 1,2,3) (1994) 231-275
    • (1994) Funda-Menta Informaticae , vol.20 , Issue.1,2,3 , pp. 231-275
    • Trakhtenbrot, B.A.1
  • 34
    • 84879540352 scopus 로고    scopus 로고
    • Origins and metamorphose of the trinity: Logics, nets, automata
    • Trakhtenbrot, B.A.: Origins and metamorphose of the trinity: Logics, nets, automata, Proceedings, LICS’95
    • Proceedings, LICS’95
    • Trakhtenbrot, B.A.1


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