Author:
Boigelot Bernard,Herbreteau Frédéric,Mainz Isabelle
Publisher
Springer International Publishing
Reference15 articles.
1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
2. Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. Ph.D. thesis, Université de Liège (1998)
3. Boigelot, B.: On iterating linear transformations over recognizable sets of integers. Theoretical Computer Science 309(1-3), 413–468 (2003)
4. Lecture Notes in Computer Science;B. Boigelot,2012
5. Lecture Notes in Computer Science;B. Boigelot,2006
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Flat Petri Nets (Invited Talk);Application and Theory of Petri Nets and Concurrency;2021
2. Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces;Automated Technology for Verification and Analysis;2018