Author:
Yan Rongjie,Li Guangyuan,Zhang Wenliang,Peng Yunquan
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
2. Lecture Notes in Computer Science;E. Asarin,1998
3. Behrmann, G., Larsen, K.G., Pearson, J., Weise, C., Yi, W.: Efficient timed reachability analysis using clock difference diagrams. In: Computer Aided Verification, pp. 341–353 (1999)
4. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)
5. Lecture Notes in Computer Science;D. Beyer,2001