Skip to content

Commit

Permalink
Add comment about the two simulation algorithms.
Browse files Browse the repository at this point in the history
  • Loading branch information
daemontus committed Jun 21, 2023
1 parent 686c1ed commit 4cfa3ca
Showing 1 changed file with 5 additions and 0 deletions.
5 changes: 5 additions & 0 deletions nfvsmotifs/motif_avoidant.py
Original file line number Diff line number Diff line change
Expand Up @@ -120,6 +120,11 @@ def _preprocess_candidates(
# is randomized but deterministic.
generator = random.Random(1234567890)

# Use stochastic simulation to prune the set of candidate states.
# We use different simulation approach depending on whether this space
# is a minimal trap or not. In previous work, this was shown to work
# well, but in the future we need to better document the resoning
# behind these two algorithms.
if is_in_an_mts == False:
# Copy is sufficient because we won't be modifying the states within the set.
candidates_dnf = candidates.copy()
Expand Down

1 comment on commit 4cfa3ca

@github-actions
Copy link

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Coverage

Coverage Report
FileStmtsMissCoverMissing
nfvsmotifs
   SuccessionDiagram.py1552087%6–7, 59, 67–70, 100, 110–111, 159, 189, 199, 203, 213, 217, 297–300, 407
   interaction_graph_utils.py142894%6–9, 57, 70, 95–96
   motif_avoidant.py137596%25, 58, 75, 112, 236
   petri_net_translation.py84693%23–24, 52, 63–64, 94
   pyeda_utils.py953464%12, 56–66, 90, 95, 98–112, 140–144
   space_utils.py1101487%15–16, 36–43, 52, 198, 213, 270
   state_utils.py681282%15, 55–66, 98, 105, 114
   terminal_restriction_space.py44393%6–7, 80
   trappist_core.py1862288%10–11, 39, 41, 81, 122, 182, 184, 186, 221–223, 249, 260–261, 306, 308, 338, 378, 380, 411, 440
nfvsmotifs/FVSpython3
   FVS.py481079%90–91, 97, 133, 183–189
   FVS_localsearch_10_python.py90199%179
TOTAL125613589% 

Tests Skipped Failures Errors Time
220 0 💤 0 ❌ 0 🔥 2m 30s ⏱️

Please sign in to comment.