Analysis of timed systems based on time-abstracting bisimulations

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

Volumn 1102, Issue , 1996, Pages 232-243

  Tripakis, S ^a   Yovine, S ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; FAULT TOLERANCE; TIME SHARING SYSTEMS;

BISIMULATIONS; COMPLEMENTATION; INFINITE TRANSITION SYSTEMS; MINIMAL MODEL; MINIMAL MODEL GENERATIONS; REFINEMENT METHODS; TIMED AUTOMATA; TIMED SYSTEMS;

ABSTRACTING;

EID: 84957353962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61474-5_72     Document Type: Conference Paper

References (15)

1. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proc. IEEE RTSS’92, 1992.
2. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In Proc. CONCUR 1992. LNCS 630, 1992.
3. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
4. A. Bouajjani, J.C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programming, 18:247-269, 1992.
5. D. Bosscher, I. Polak and F. Vaandrager. Verification of an audio control protocol. In Proc. FTRTFT’94, LNCS 863, 1994.
6. C. Daws, A. Ohvero, S. Tripakis and S. Yovine The tool KRONOS. Workshop on Hybrid Systems and Autonomous Control, DIMACS, 1995. To appear in LNCS.
7. C. Daws, A. Olivero and S. Yovine. Verifying ET-LOTOS programs with KRONOS. In Proc. FORTE’94, 1994.
8. C. Daws and S. Yovine. Two examples of verification of multirate timed automata with KRONOS. In Proc. IEEE RTSS’95, 1995.
9. J. Cl Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodriguez, and J. Sifakis. A tool box for the verification of LOTOS programs. In 14th Int. Conf. on Software Engineering, 1992.
10. J.C. Fernandez and L. Mounier. On the fly verification of behavioural equivalences and preorders. In Proc. CAV’91, LNCS 757, 1991.
11. D. Lee and M. Yannakakis. On-line minimization of transition systems. In Proc. ACM Symposium on Theory of Computing, 1992.
12. K. G. Larsen and W. Yi. Timed abstracted bisimulation: implicit specification and decidability. In Proc. MFPS’93, 1993.
13. R. Milner. A Calculus of Communicating Systems, LNCS 92, 1980.
14. A. Olivero, J. Sifakls, and S. Yovine. Using abstractions for the verification of linear hybrid systems. In CAV’94, LNCS 818, 1994.
15. M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. In CAV’93, LNCS 697, 1993.