Repository navigation
Add Dining Philosophers example - #28
Merged
Merged
Conversation
Collaborator
|
Thank you very much for the changes. A few more comments:
TypeOK == ShareFork(p,q) == {LeftFork(p), RightFork(p)} \cap {LeftFork(q), RightFork(q)} # {} If you agree, please make this changes and I'll merge the PR. Best regards, |
Collaborator
|
Thank you very much for your contribution! Merged into tlaplus/Examples. |
lemmy
added a commit
that referenced
this pull request
Nov 5, 2026
The Summary of TLA+ gives SUBSET, UNION, \cup, and \ precedence 8-8. Equal precedence leaves the binding unspecified, and TLA+ rejects the expression. SANY has given SUBSET and UNION precedence 10-13, under which SUBSET S \ T parses as (SUBSET S) \ T and A \cup UNION B as A \cup (UNION B). tlaplus#1508 restores the documented ranges, so the unparenthesized forms become syntax errors. The parentheses keep the binding SANY has been using. Related to Github RFC issue #28 tlaplus/rfcs#28 See Github pull request #1508 tlaplus/tlaplus#1508 Co-authored-by: Grok 4.7 <noreply@x.ai> Signed-off-by: Markus Alexander Kuppe <github.com@lemmster.de>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
I've been trying to learn TLA+ to suss out a rare bug in my code. On https://learntla.com/temporal-logic/operators/ , I came across a toy Dining Philosophers problem. It took me several hours to make everything work and build something free of deadlocks, livelocks, or starvation, so I'd like to add my knowledge to the bank.
This model solves the problem via Dijkstra's resource hierarchy solution. You should be able to run it with no changes via VSCode or the command-line, or with minimal changes via TLA toolbox.