Skip to content
Snippets Groups Projects
Commit df5b5eaa authored by Markus Alexander Kuppe's avatar Markus Alexander Kuppe
Browse files

Explain exponential blowup of L parameter in Grid5k spec.

[Docu]
parent 69851b2e
Branches
No related tags found
No related merge requests found
...@@ -4,6 +4,9 @@ ...@@ -4,6 +4,9 @@
\* while (TRUE) { \* while (TRUE) {
\* with (i \in 1..N) { \* with (i \in 1..N) {
\* x[i] := (x[i] + 1) % K ; \* x[i] := (x[i] + 1) % K ;
\* \* SUBSET 1..L causes TLC to generate the power set of the set 1..L.
\* \* For each set in the power set, TLC evaluates if the set's elements
\* \* are members of the other power set... KaBOOM!
\* await SUBSET 1..L \subseteq SUBSET 1..L \* await SUBSET 1..L \subseteq SUBSET 1..L
\* } \* }
\* } \* }
...@@ -11,7 +14,7 @@ ...@@ -11,7 +14,7 @@
\* next-state action \* next-state action
\* - K^N is the total number of distinct states \* - K^N is the total number of distinct states
\* - The time to compute a single state is asymptotically \* - The time to compute a single state is asymptotically
\* proportional to 2^L \* proportional to 2^L.
\* - C defines the number of initial states. Let C=n \* - C defines the number of initial states. Let C=n
\* then the state graph has n isomorphic disjunct subgraphs. \* then the state graph has n isomorphic disjunct subgraphs.
EXTENDS Integers, FiniteSets EXTENDS Integers, FiniteSets
......
File mode changed from 100644 to 100755
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment