Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
K
KTLA Study
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Kirill Smelkov
KTLA Study
Commits
e91d85aa
Commit
e91d85aa
authored
Feb 11, 2022
by
Kirill Smelkov
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
.
parent
1ddff802
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
8 additions
and
5 deletions
+8
-5
Route.tla
Route.tla
+2
-2
Route.toolbox/Route___Model_1.launch
Route.toolbox/Route___Model_1.launch
+6
-3
No files found.
Route.tla
View file @
e91d85aa
...
...
@@ -174,13 +174,13 @@ PathMinimal(p) == ~ \E pp \in SeqN(Nodes, Cardinality(Nodes)) :
\* Paths are OK if they are all correct and minimal.
PathsOK ==
(
\A n \in Nodes :
PathsOK == \A n \in Nodes :
LET p == ParentPath(n)
IN
/\ p[1] = n
/\ p[Len(p)] = root \* not NoRoute
/\ PathCorrect(p)
/\ PathMinimal(p)
)
/\ PathMinimal(p)
\* Paths must be all OK when terminated.
THEOREM Terminated => PathsOK
...
...
Route.toolbox/Route___Model_1.launch
View file @
e91d85aa
...
...
@@ -36,9 +36,12 @@
<stringAttribute
key=
"specName"
value=
"Route"
/>
<stringAttribute
key=
"tlcResourcesProfile"
value=
"local custom"
/>
<listAttribute
key=
"traceExploreExpressions"
>
<listEntry
value=
"1Terminated"
/>
<listEntry
value=
"1[ n \in Nodes |-> ParentPath(n) ]"
/>
<listEntry
value=
"0[ n \in Nodes |-> LET p == ParentPath(n) IN << PathCorrect(p), PathMinimal(p) >> ]"
/>
<listEntry
value=
"1[ n \in Nodes |-> PathCorrect(ParentPath(n)) ]"
/>
<listEntry
value=
"1[ n \in Nodes |-> PathMinimal(ParentPath(n)) ]"
/>
<listEntry
value=
"1[ n \in Nodes |-> LET p == ParentPath(n) IN << PathCorrect(p), PathMinimal(p) >> ]"
/>
<listEntry
value=
"0[ n \in Nodes |-> PathCorrect(ParentPath(n)) ]"
/>
<listEntry
value=
"0[ n \in Nodes |-> PathMinimal(ParentPath(n)) ]"
/>
<listEntry
value=
"1[ n \in Nodes |-> LET p == ParentPath(n) IN p[1] = n /\ p[Len(p)] = root]"
/>
<listEntry
value=
"1PathsOK"
/>
</listAttribute>
</launchConfiguration>
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment