The following pages link to (Q4411960):
Displaying 15 items.
- PPL (Q17497) (← links)
- Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets (Q442295) (← links)
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems (Q748756) (← links)
- Some ways to reduce the space dimension in polyhedra computations (Q853727) (← links)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (Q1620957) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques (Q2343139) (← links)
- On finite linear systems containing strict inequalities (Q2401512) (← links)
- Reasoning about synchronization in GALS systems (Q2505629) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (Q3522073) (← links)
- Analysis of Linear Hybrid Systems in CLP (Q3617430) (← links)
