Author:
Clarisó Robert,Cortadella Jordi
Reference35 articles.
1. A theory of timed automata;Alur;Theoretical Computer Science,1994
2. On canonical representations of convex polyhedra;Avis,2002
3. R. Bagnara, Data-flow analysis for constraint logic-based languages, Ph.D. Thesis, University of Pisa, 1997
4. G. Behrmann, K.G. Larsen, J. Pearson, C. Weise, W. Yi, Efficient timed reachability analysis using clock difference diagrams, in: Proc. International Conference on Computer Aided Verification, 1999, pp. 341–353
5. Graph-based algorithms for Boolean function manipulation;Bryant;IEEE Transactions on Computers,1986
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献