Concurrency in timed automata

Theoretical Computer Science

Volumn 309, Issue 1-3, 2003, Pages 503-527

  Lanotte, Ruggero ^a   Maggiolo Schettini, Andrea ^a   Tini, Simone ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; FORMAL LANGUAGES; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

CONCURRENT TIMED AUTOMATA (CTA); SEQUENTIAL AUTOMATA;

AUTOMATA THEORY;

EID: 0242440303     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00316-5     Document Type: Article

References (10)

1. Alur R., Dill D.L. A theory of timed automata. Theor. Comput. Sci. 126:1994;183-235.
2. Bérard B., Diekert V., Gastin P., Petit A. Characterization of the power of silent transitions in timed automata. Fund. Inform. 36:1998;145-182.
3. S. Bornot, J. Sifakis, Relating time progress and deadlines in hybrid systems, in: Proc. HART '97, Lecture Notes in Computer Science, Vol. 1201, Springer, Berlin, 1997, pp. 266-300.
4. S. Bornot, J. Sifakis, On the composition of hybrid systems, in: Proc. HSCC '98, Lecture Notes in Computer Science, Vol. 1386, Springer, Berlin, 1998, pp. 69-83.
5. P. Bouyer, C. Dufourd, E. Fleury, A. Petit, Are timed automata updatable? in: Proc. CAV 2000, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000, pp. 464-479.
6. P. Bouyer, C. Dufourd, E. Fleury, A. Petit, Expressiveness of updatable timed automata, in: Proc. MFCS 2000, Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, 2000, pp. 232-242.
7. Drusinsky D., Harel D. On the power of bounded concurrency I. Finite automata J. Assoc. Comput. Mach. 41:1994;217-539.
8. Lanotte R., Maggiolo-Schettini A., Peron A. Timed cooperating automata. Fund. Inform. 43:2000;153-173.
9. Lanotte R., Maggiolo-Schettini A., Peron A., Tini S. Transformation in timed cooperating automata. Fund. Inform. 47:2001;271-282.
10. Thomas W. Languages, automata and logic. Rozenberg G., Salomaa A. Handbook of Formal Languages. Vol. 3:1997;289-455 Springer, New York. (Chapter 7).