Timed automata and recognizability

Information Processing Letters

Volumn 65, Issue 6, 1998, Pages 313-318

  Herrmann, Philippe ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Formal languages; Real time systems; Timed automata

Indexed keywords

AUTOMATA THEORY; CONSTRAINT THEORY; FORMAL LANGUAGES; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SET THEORY; THEOREM PROVING;

TIMED AUTOMATA;

FORMAL LOGIC;

EID: 0032022781     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00217-2     Document Type: Article

References (5)

1. R. Alur, D.L. Dill, Automata for modelling real-time systems, in: Proc. ICALP 90, Lecture Notes in Computer Science, vol. 443, Springer, Berlin, 1990, pp. 322-335.
2. R. Alur, D.L. Dill, A theory of timed automata, Theoret. Comput. Sci. 126 (1994) 183-235.
3. V. Diekert, P. Gastin, A. Petit, Removing ε-transitions in timed automata, in: Proc. STACS 97, Lecture Notes in Computer Science, vol. 1200, Springer, Berlin, 1997, pp. 583-594.
4. V. Gupta, T.A. Henzinger, R. Jagadeesan, Robust timed automata, in: Proc. HART 97, Lecture Notes in Computer Science, vol. 1201, Springer, Berlin, 1997, pp. 331-345.
5. P. Herrmann, Timed automata and recognizability. Tech. Rept., LIAFA, University Paris 7, 1997.