Author:
Zhang Dezhuang,Cleaveland Rance
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Alur, R., Courcoubetis, C., Dill, D., Halbwachs, N., Wong-Toi, H.: An implementation of three algorithms for timing verification based on automata emptiness. In: RTSS 1992 (1992)
2. Andersen, H.R.: Model checking and boolean graphs. Theoretical Computer Science 126(1) (1994)
3. Balarin, F.: Approximate reachability analysis of timed automata. In: IEEE RTSS 1996 (1996)
4. Behrmann, G., Bengtsson, J., David, A., Larsen, K.G., Pettersson, P., Yi, W.: Uppaal implementation secrets. In: FTRTFT 2002 (2002)
5. Berezin, S.: Model Checking and Theorem Proving: a Unified Framework. PhD thesis, Carnegie Mellon University (2002)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献