Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
487
Table 5 Memory requirements for the protocol of the dining cryptographers.
in Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
Table 2. Example of translation from Promela into IL language.
"... In PAGE 8: ...ig. 1. Nested IF construction example. Table2 does not contain never claim which (for sake of clarity) is presented in table 3. This never claim expresses the correctness of the Dining Cryptographers protocol.... ..."
Table 2. Dining
2004
"... In PAGE 4: ...Currently, JavaFAN can detect the deadlock for up to 8 philosophers at the bytecode level and up to 9 philosophers at the Java Lanugage level in a reason- able amount of time ( Table2 ). It can also prove the program deadlock-free for up to 7 philosophers at both levels.... ..."
Cited by 14
Table 2. Dining
2004
"... In PAGE 4: ...Currently, JavaFAN can detect the deadlock for up to 8 philosophers at the bytecode level and up to 9 philosophers at the Java Language level in a reason- able amount of time ( Table2 ). It can also prove the program deadlock-free for up to 7 philosophers at both levels.... ..."
Cited by 14
Table 2. Dining
2004
"... In PAGE 13: ... The sequence shows a situation in which each philosopher has ac- quired one fork and is waiting for the other fork. Currently, we can detect the deadlock for up to 9 philosophers ( Table2 ). We also model checked a slightly modified version of the same program which avoids deadlock.... ..."
Cited by 4
Table 3: The dining philosophers
Table 3: The dining philosophers
Table 1: Dining philosophers
"... In PAGE 12: ... In order to eat, a philosopher executes two nested synchronized statements, the outer one on his left fork and the inner one on his right fork. Table1 shows the results obtained byhaving 3, 4, 5, 6 philosophers acting concurrently in a non-deadlocking manner (i.e.... ..."
Results 1 - 10
of
487
