Goran Frehse wrote:

I just tried the new PPL with some examples. Here are some numbers taken from a reachability analysis of a hybrid automaton: (PPL 0.5 -> PPL 0.61)

- Remapping and Intersection of 1249 3--6-dimensional polyhedra: 1.26s -> 0.85s - Remapping and Intersection of 1341 2--4-dimensional polyhedra: 1.64s -> 1.45s - Reachability analysis in 3-dimensional space (roughly 10000 intersections and projections in 6--3 dimensions): 57.31s -> 55.87s

I'm very happy with these results, so congratulations!

On behalf of all the developers: Thank you! If you care about (time and memory) performance, whatch out for PPL 0.7. Cheers, Roberto -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it