On the power of non-observable actions in timed automata

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

Volumn 1046, Issue , 1996, Pages 255-268

  Bérard, Béatrice ^a   Gastin, Paul ^b   Petit, Antoine ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS;

NON-OBSERVABLE ACTIONS; TIMED AUTOMATA; TIMED LANGUAGES;

REAL TIME SYSTEMS;

EID: 84948174778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_22     Document Type: Conference Paper

References (21)

1. R. Alur, C. Courcoubetis, Dill D., N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In Proceedings of CONCUR '92, LNCS 630, 1992.
2. R. Alur, C. Courcoubetis, and T.A. Heiiziuger. The observational power of docks. In Proceedings of CONCUR'94, LNCS 836, pages 162-177, 1994.
3. R. Alur and D.L. Dill. Automata for modeling real-time systems. In Proceedings of ICALP'90, LNCS 443, pages 322-33-5, 1D90Ì
4. R. Alur and D.L. Dill. A t heory of timed automata. Theoretical Computer Science, 126:183-235, 1904.
5. R. Alur, L. Fix, and T.A. Heiiziuger. A det.enninizable class of timed automata. In Proceedings of CAV'.'AF LNCS 818, pages 1-13, 1994.
6. R. Alur and T.A. Heiiziuger. Back to the future: towards a theory of timed regular languages. In Procewlmyx of FOCS'92, LNCS, pages 177-186, 1992.
7. B. Bérard. Uiitiming timed languages. Information Processing Letters, 55:129-135, 1995.
8. B. Bérard, P. Gastin, and A. Petit. On the power of non observable actions in timed automata. Tech. Rep. 95.08, ENS de Cachan, LIFAC, 1995.
9. E. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Trans. Programming Languages and Systems, 8:244-263, 1986.
10. C. Courcoubetisami, M. Yannakakis. Minimum and maximum delay problems in real-time systems, in Procetdings of CAV'91, LNCS 575, pages 399-409, 1991.
11. T. Heiiziuger, Z. Manna, and A. Piiueli. Temporal proofs methodologies for realtime systems. In Proceedings of PC PL '91, pages 353-366, 1991.
12. T. Heiiziuger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Compulation, 111(2): 193-244, 1994.
13. T.A. Heiiziuger, P.W. Kopke, and Wong Toi H. The expressive power of clocks. In Proceedings of lCALP'9!i, LNCS 944, pages 335-346, 1995.
14. N. Lynch and H. Attiya. Using mappings to prove timing properties. in Proceedings of PODC'90, pages JG5-280, 1990.
15. X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In Proceedings of REX workshop "Real-time: theory in practice", LNCS 600, pages 549-572, 1991.
16. J. Ostroff. Temporal Logic of Reiil-titne Systems. Research Studies Press, 1990.
17. C. Ramchandani. Analysis of asynchronous concurrent systems by petri nets. Technical report., Massachusetts Institute of Technology, 1974.
18. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoreticul Computer Science, pages 133-191. Elsevier Science Publishers (North-Holland), 1990.
19. M. Vardi. Verification of concuneiit-programs-the automata-theoretic framework. In Proceedings of LICS'87, pages 167-176, 1987.
20. P. Wolper, M. Vardi, and A.P. Sistla. Reasoning about infinite computation paths. In Proceedings of FOCS'83, pages 185-194, 1983.
21. H. Wong-Toi and G. Hojtmann. The control of dense real-time discrete event systems. In Proceedings of the 30th IEEE Conf. on Decision and Control, pages 1527-1528, 1991.