TLCMC: non-strict BFS, BFS level tracking, state constraints, and refinement to MCReachability.#204
Draft
TLCMC: non-strict BFS, BFS level tracking, state constraints, and refinement to MCReachability.#204
Conversation
lemmy
force-pushed
the
mku-TLCMultipleWorkers
branch
from
c6758e4 to
da9ceea
Compare
and refinement to MCReachability. Parameterize TLCMC with constant K (number of workers): dequeue any of the first Min(K, Len(S)) elements from the frontier instead of always Head(S), modeling TLC's degraded BFS with multiple workers. Track BFS level of each explored state in new variable L (distance from an initial state). Add Constraint(s, l) predicate to prune successors from exploration based on state and level. Inline Min from CommunityModules to keep the spec/example self-contained. Introduce MCReachability, a high-level spec with set-based frontier S and non-deterministic exploration order. TLCMC refines MCReachability via a refinement mapping. Extract graph definitions into StateGraphs module; refactor TestGraphs and add TestMCReachability as test harnesses. Select graph and worker count via IOEnv to run all test configurations from a single .cfg file without per-graph TLC invocations. [Feature] Signed-off-by: Markus Alexander Kuppe <github.com@lemmster.de>
lemmy
force-pushed
the
mku-TLCMultipleWorkers
branch
from
da9ceea to
c48a6ee
Compare
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.
TLCMC: non-strict BFS, BFS level tracking, state constraints, and refinement to MCReachability.
Parameterize TLCMC with constant K (number of workers): dequeue any of the first Min(K, Len(S)) elements from the frontier instead of always Head(S), modeling TLC's degraded BFS with multiple workers. Track BFS level of each explored state in new variable L (distance from an initial state). Add Constraint(s, l) predicate to prune successors from exploration based on state and level. Inline Min and Remove from CommunityModules to keep the spec self-contained.
Introduce MCReachability, a high-level spec with set-based frontier S and non-deterministic exploration order. TLCMC refines MCReachability via refinement mapping (S |-> SeqToSet(S), done |-> counterexample # <<>>, T augmented with pending successors).
Extract graph definitions into StateGraphs module; refactor TestGraphs and add TestMCReachability as test harnesses. Select graph and worker count via IOEnv to run all test configurations from a single .cfg file without per-graph TLC invocations.
[Feature]