Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
T
tlatools
Manage
Activity
Members
Labels
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
general
stups
tlatools
Commits
df5b5eaa
Commit
df5b5eaa
authored
Mar 13, 2017
by
Markus Alexander Kuppe
Browse files
Options
Downloads
Patches
Plain Diff
Explain exponential blowup of L parameter in Grid5k spec.
[Docu]
parent
69851b2e
Branches
Branches containing commit
No related tags found
No related merge requests found
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
general/performance/Grid5k.tla
+4
-1
4 additions, 1 deletion
general/performance/Grid5k.tla
general/performance/measure.sh
+0
-0
0 additions, 0 deletions
general/performance/measure.sh
with
4 additions
and
1 deletion
general/performance/Grid5k.tla
+
4
−
1
View file @
df5b5eaa
...
@@ -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
...
...
This diff is collapsed.
Click to expand it.
general/performance/measure.sh
100644 → 100755
+
0
−
0
View file @
df5b5eaa
File mode changed from 100644 to 100755
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment