Equations on timed languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1386, Issue , 1998, Pages 1-12

  Asarin, Eugene ^a  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957885372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64358-3_28     Document Type: Conference Paper

References (5)

1. Eugene Asarin, Paul Caspi, and Oded Maler. A Kleene theorem for timed automata. In Proc. 11th Annual IEEE Symposium on Logic in Computer Science, pages 160-171, Warsaw, June 1997. IEEE Computer Society.
2. Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. Janusz A. Brzozowski. A survey of regular expressions and their applications. IRE Trans. on Electronic Computers, EC-11(3):324-335, 1962.
4. Conrado Daws, Alfredo Olivero, Stavros Tripakis, and Sergio Yovine. The tool KRONOS. In Rajeev Alur, Thomas A. Henzinger, and Eduardo D. Sontag, editors, Hybrid Systems III, Verification and Control, number 1066 in Lecture Notes in Computer Science, pages 208-219. Springer-Verlag, 1996.
5. S.C. Kleene. Representations of events in nerve nets and finite automata. In R. McNaughton and H. Yamada, editors, Automata Studies, pages 3-42. Princeton University Press, 1956.