Author:
Bollig Benedikt,Gastin Paul
Publisher
Springer Berlin Heidelberg
Reference37 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;S. Andova,2004
3. Lecture Notes in Computer Science;C. Baier,2008
4. Baier, C., Größer, M.: Recognizing ω-regular languages with probabilistic automata. In: Proceedings of LICS 2005, pp. 137–146. IEEE Computer Society Press, Los Alamitos (2005)
5. Lecture Notes in Computer Science;B. Bollig,2004
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献