| Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces. | 0 | 0.34 | 2018 |
| An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention. | 0 | 0.34 | 2017 |
| From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance. | 0 | 0.34 | 2016 |
| Efficient Path Interpolation and Speed Profile Computation for Nonholonomic Mobile Robots | 0 | 0.34 | 2015 |
| Acceleration of Affine Hybrid Transformations. | 1 | 0.36 | 2014 |
| Min Max Generalization for Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes | 1 | 0.35 | 2012 |
| Domain-specific regular acceleration | 2 | 0.37 | 2012 |
| Automata-Based symbolic representations of polyhedra | 1 | 0.36 | 2012 |
| On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases | 0 | 0.34 | 2010 |
| Implicit Real Vector Automata | 3 | 0.41 | 2010 |
| Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization | 0 | 0.34 | 2009 |
| A Generalization of Semenov's Theorem to Automata over Real Numbers | 9 | 0.65 | 2009 |
| On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases | 2 | 0.41 | 2008 |
| A generalization of Cobham's theorem to automata over real numbers | 5 | 0.44 | 2007 |
| The power of hybrid acceleration | 13 | 0.59 | 2006 |
| Number-Set Representations for Infinite-State Verification | 0 | 0.34 | 2005 |
| An effective decision procedure for linear arithmetic over the integers and reals | 35 | 1.11 | 2005 |
| Omega-Regular Model Checking | 18 | 0.72 | 2004 |
| Counting the Solutions of Presburger Equations without Enumerating Them | 15 | 0.82 | 2004 |
| On iterating linear transformations over recognizable sets of integers | 16 | 0.80 | 2003 |
| An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables | 4 | 0.50 | 2003 |
| Hybrid Acceleration Using Real Vector Automata (Extended Abstract) | 4 | 0.40 | 2003 |
| Iterating Transducers in the Large (Extended Abstract) | 14 | 0.62 | 2003 |
| Representing Arithmetic Constraints with Finite Automata: An Overview | 26 | 1.12 | 2002 |
| On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables | 20 | 0.86 | 2001 |
| On the Construction of Automata from Linear Arithmetic Constraints | 55 | 2.55 | 2000 |
| Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs | 78 | 7.35 | 1999 |
| On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) | 28 | 1.44 | 1998 |
| Verifying Systems with Infinite but Regular State Spaces | 90 | 4.07 | 1998 |
| An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract) | 23 | 1.38 | 1997 |
| Automatic Synthesis of Specifications from the Dynamic Observation of Reactive Programs | 10 | 1.39 | 1997 |
| The Power of QDDs (Extended Abstract) | 43 | 2.48 | 1997 |
| Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract) | 46 | 2.57 | 1996 |
| Model Checking in Practice: An Analysis of the ACCESS.bus Protocol using SPIN | 15 | 4.33 | 1996 |
| An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) | 41 | 2.13 | 1995 |
| Symbolic Verification with Periodic Sets | 89 | 5.66 | 1994 |
