progression: (8192 states 12156 trans. 1 S., depth=23, breadth=1432) (16384 states 25067 trans. 2 S., depth=26, breadth=2612) (24576 states 37704 trans. 3 S., depth=28, breadth=3829) (1277952 states 2369806 trans. 278 S., depth=55, breadth=101778) (1286144 states 2385398 trans. 279 S., depth=55, breadth=101778) (1294336 states 2400944 trans. 281 S., depth=55, breadth=101778) (2596864 states 5238512 trans. 635 S., depth=78, breadth=103218) (2605056 states 5259095 trans. 637 S., depth=79, breadth=103218) (2613248 states 5280374 trans. 640 S., depth=81, breadth=103218) After 10 minutes and 42 seconds (on a cheap PC with a 950-MHz processor and 512 MB of RAM), the exhaustive simulation is completed and the Simulator displays the results: Number of states : 2620001 Number of transitions : 5298932 Maximum depth reached : 92 Maximum breadth reached : 103218 duration : 10 mn 42 S Number of exceptions : 23139 Number of deadlocks : 0 Number of stop conditions : 0 Transitions coverage rate : 100.00 (0 transitions not covered) States coverage rate : 100.00 (0 states not covered) Basic blocks coverage rate : 94.74 (3 basic blocks not covered) The simulation has covered all the 2620001 reachable states of the current configuration of our SDL model. Obtaining such a coverage of the behaviors would take months of interac- tive simulation. 23139 exception states have been reached. To estimate the size of a global state of the SDL model, type tree: > tree system v76test block datalink process atob ( 40 bytes ) process btoa ( 40 bytes ) block dlca process dispatch ( 60 bytes ) process dlc ( 96 bytes ) block dlcb process dispatch ( 60 bytes ) process dlc ( 96 bytes ) Exhaustive Simulation 237 Thus, the size of one global state is at minimum (no instance of DLC exists): 40 + 40 + 60 + 60 = 200 bytes And the maximum is (when two instances of DLC exist on each side): 200 + (96 X 4) = 584 bytes Therefore, the average state size is (not counting the input queues): (200 + 584) / 2 = 392 bytes The memory occupied by the states graph would 