From: schristensen@daimi.aau.dk (Soren Christensen) To: designCPN@daimi.aau.dk Date: Fri, 19 Jul 1996 09:09:55 +0200 Subject: Result of the summer :-) I always get a bit tired when I hear results like "with BDD's we can handle state spaces of size up to 10^200", but why not beat it anyway! If you carefully examine the Distributed database example, see: http://www.daimi.aau.dk/designCPN/exam/Ographs/DistributedDataBase/index.html. It turns out that the states of OS-graph of this example can be represented as two integers and a single bit. If you draw a net which directly models this idea then the O-graph of this new model will be isomorphic to the OS-graph of the original model. The results below is just to indicate that "we can handle state spaces of size up to 10^288", and it actually takes less than 22 minutes to generate! DMB O-graph OE-graph Time(s) Nodes/s Arcs/s Nodes Arcs Nodes Arcs 20 23245229341 2,9444E+11 211 382 <1 250 1,589E+121 2,6378E+123 31376 62252 151 208 412 400 9,4068E+192 2,5022E+195 80201 159602 441 182 362 500 6,0600E+240 2,0160E+243 125251 249502 905 138 276 600 3,7479E+288 1,4966E+291 180301 359402 1310 138 274 Have a nice summer!! Regards, Soren Christensen --------------------------------------------------------------------- | Soren Christensen, Computer Science Department, Aarhus University | | Ny Munkegade 116, DK-8000 Aarhus C, DENMARK | | email: schristensen@daimi.aau.dk | phone: +45 89 42 32 65 | | telefax: +45 89 42 32 55 | phone at home: +45 86 93 63 26 | | WWW URL: | --------------------------------------------------------------------- --- [[ Post messages and summary of replies: designCPN@daimi.aau.dk ]] [[ To (un)subscribe, send "help" to: Majordomo@daimi.aau.dk ]] [[ The moderator's address: designCPN-owner@daimi.aau.dk ]] [[ World Wide Web URL: http://www.daimi.aau.dk/designCPN/email/ ]]