Timed cooperating automata

Fundamenta Informaticae

Volumn 43, Issue 1, 2000, Pages 153-173

  Lanotte, Ruggero ^a   Maggiolo Schettin, Andrea ^a   Peron, Adriano ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; MATHEMATICAL MODELS;

CLOSURE PROPERTIES; EXPRESSIVENESS; SUCCINCTNESS; TIMED COOPERATING AUTOMATA (TCA);

AUTOMATA THEORY;

EID: 0034248233     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-2000-43123408     Document Type: Article

References (13)

1. Alur, R. and Dill, D.: "A Theory of Timed Automata", Theoretical Computer Science, 126, 1994, 183-235.
2. Alur, R., Fix, L. and Henzinger, A.: "Event-Clock Automata: A Determinizable Class of Timed Automata", Theoretical Computer Science, 211, 1999, 253-273.
3. Berard, B., Petit, A., Diekert, V. and Gastin, P.: "Characterization of the Expressive Power of Silent Transitions in Timed Automata", Fundamenta Informaticae, 36, 1998, 145-182.
4. Berry, G. and Gonthier, G.: "The Esterel Synchronous Programming Language: Design, Semantics, Implementation", Science of Computer Programming, 19, 1992, 87-152.
5. Choffrut, C. and Goldwurm, M.: "Timed Automata with Periodic Clock Constraints", Rapport L.I.A.F.A. n. 99/28, Université Paris VII, 1999.
6. Drusinsky, D. and Harel, D.: "On the Power of Bounded Concurrency I: Finite Automata", Journal of ACM, 41, 1994, 517-539.
7. D'Souza, D. and Thiagarajan, P.S.: "Product Interval Automata: a Subclass of Timed Automata", Proc. FSTTCS'99, LNCS 1738, Springer, Berlin, 1999, 60-71.
8. Harel, D.: "Statecharts: A Visual Formalism for Complex Systems", Science of Computer Programming, 8, 1987, 231-274.
9. Lanotte, R., Maggiolo-Schettini, A. and Peron, A.: "Timed Cooperating Automata", Proc. of the CS&P'99 Workshop (H.-D. Burkhard, L. Czaja, H.S. Nguyen, P. Starke Eds.), Warsaw University Press, Warsaw, 1999, 96-106.
10. Maggiolo-Schettini, A. and Peron, A.: "Retiming Techniques for Statecharts", Proc. FTRTFT '96, LNCS 1135, Springer, Berlin, 1996, 55-71.
11. Mikk, E., Laknech, Y. and Siegel, M.: "Hierarchical Automata as Models for Statecharts", Proc. ASIAN '97, LNCS 1345, Springer, Berlin, 1997, 181-196.
12. Peron, A. and Maggiolo-Schettini, A.: "Transitions as Interrupts: A New Semantics for Timed Statecharts", Proc. TACS '94, LNCS 789, Springer, Berlin, 1994, 806-821.
13. Thomas, W.: "Automata on Infinite Objects", Handbook of Theoretical Computer Science (J. van Leeuwen Ed.), Elsevier Science Publishers, Amsterdam, 1990, 134-191.