Author:
Salah Ramzi Ben,Bozga Marius,Maler Oded
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Lecture Notes in Computer Science;R. Alur,1999
2. Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)
3. Alur, R., Itai, A., Kurshan, R.P., Yanakakis, M.: Timing Verification by Successive Approximation. Information and Computation 118, 142–157 (1995)
4. Balarin, F.: Approximate Reachability Analysis of Timed Automata. In: Proc. RTSS 1996, pp. 52–61. IEEE, Los Alamitos (1996)
5. Lecture Notes in Computer Science;M. Bozga,2002
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Boolean Determinant Calculus;Dynamic Control and Optimization;2022
2. Formal Timing Analysis of Digital Circuits;Communications in Computer and Information Science;2019
3. A Temporal Logic Approach to Modular Design of Synthetic Biological Circuits;Computational Methods in Systems Biology;2013
4. On Timed Models of Gene Networks;Lecture Notes in Computer Science;2007
5. On Interleaving in Timed Automata;CONCUR 2006 – Concurrency Theory;2006