-------- Original Message -------- Subject: question about PPL Date: Mon, 21 May 2007 17:14:33 +0200 (CEST) From: letallec@i3s.unice.fr To: bagnara@cs.unipr.it
First of all Hello and sorry for my very bad english speaking but my italian is worst, My name is LE TALLEC Jean-François and i study synchronous language in France. i'm currently doing an internship on behavior formal proving of SyncChart and that why i started using PPL. But i would know if it is possible to determinate if there is an integer solution in a domain describe with a NNC polyhedron. i.e. : in the square x<0 ; x>1 ; y<0 ; y>1 with strict inequality i wasn't able to show that there is no solution. i tried some manipulation with "grid" and the determinate<PH> function, tried to intersect 2 NNC poly (first with the constraints and the second with the congruence) but that did nothing. So i wondered if you could explain to me how to do that if it's possible.
thanks for your attention, waiting for your response, Ciao :-)
LE TALLEC Jean-François I3S laboratory