Decomposition and composition of timed automata

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

Volumn 1644 LNCS, Issue , 1999, Pages 210-219

  Bouyer, Patricia ^a   Petit, Antoine ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN DECOMPOSITION METHODS;

DECOMPOSITION THEOREMS; TIMED AUTOMATA; TIMED LANGUAGES; UNION OPERATIONS;

AUTOMATA THEORY;

EID: 84887454941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_18     Document Type: Conference Paper

References (18)

1. R. Alur, C. Courcoubetis, D.L. Dill, N. Halbwachs, and H.WongToi. Minimization of timed transition systems. In Proceedings of CONCUR'92, LNCS 630, 1992.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, L. Fix, and T.A. Henzinger. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science, 211:253-273, 1999.
4. R. Alur and T.A. Henzinger. Back to the future: Towards a theory of timed regular languages. In Proceedings of FOCS'92, 1992.
5. E. Asarin. Equations on timed languages. In Proceedings of Hybrid'98, LNCS, 1998.
6. E. Asarin, P. Caspi and O. Maler. A Kleene theorem for timed automata. In Proceedings of LICS'97, 1997.
7. B. Berard. Untiming timed languages. Information Processing Letters, 55:129-135, 1995.
8. P. Bouyer. Automates temporisfies et modularitfie. Rapport de stage de DEA, LSV, ENS de Cachan, 1998.
9. P. Bouyer, and A. Petit. Decomposition and composition of timed automata. Technical report LSV-99-1, LSV, ENS de Cachan, 1999.
10. C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. Formal Methods in System Design, pages 385-415, 1992.
11. B. Berard, V. Diekert, P. Gastin, and A. Petit. Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, 36: 145- 182, 1998.
12. J.A. Brzozowski. A survey of regular expressions and their applications. In IRE transactions on Electronic Computers, EC-11(3): 324-335, 1962.
13. J.R. Buchi. A decision method in restricted arithmetic. In Proc Int Congr. on Logic, Methodology and Philosophy of Science, Stanford University, 1960.
14. T.A. Henzinger, P.W. Kopke, and H. Wong-Toi. The expressive power of clocks. In Proceedings of ICALP'95, LNCS 944, pages 335-346, 1995.
15. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, 1994.
16. S.C. Kleene. Representations of events in nerve and finite automata. Automata Studies, Princeton University Press, 3-42, 1956.
17. T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Proceedings of Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, 1994.
18. H. Wong-Toi and G. Homann. The control of dense real-time discrete event systems. In Proceedings of the 30th IEEE Conf. on Decision and Control, pages 1527-1528, 1991.