Fields

• drawUsing :: GraphvizCommand
   
• minLength :: Int
   
• noLongerThan :: Maybe Int
   
• petriNet :: Net s t
   
• showPlaceNames :: Bool
   
• maxDisplayedSolutions :: Int
   
• shortestSolutions :: Either (NonEmpty [t]) (NonEmpty [t])

  Solutions to the deadlock task. Left contains (some) shortest solutions when no filtering is applied. Right contains all solutions when filtering is applied. Note: Left may not contain all shortest solutions, only up to maxDisplayedSolutions.

• withLengthHint :: Maybe Int
   
• withMinLengthHint :: Bool
   
• rejectSpaceballsLength :: Maybe Int

  Minimum length of Spaceballs PIN pattern to reject during syntax checking. If set to Just n, sequences starting with n or more consecutive transitions (e.g., [t1, t2, t3, t4]) will be rejected.

Fields

• numPlaces :: Int
   
• numTransitions :: Int
   
• capacity :: Capacity Place
   
• graphLayouts :: [GraphvizCommand]

  Graph layout commands to choose from (randomly selected during generation)

• maxTransitionLength :: Int
   
• minTransitionLength :: Int
   
• transitionBehaviorConstraints :: TransitionBehaviorConstraints
   
• arrowDensityConstraints :: ArrowDensityConstraints
   
• maxPrintedSolutions :: Int
   
• rejectLongerThan :: Maybe Int
   
• showLengthHint :: Bool
   
• showMinLengthHint :: Bool
   
• showPlaceNamesInNet :: Bool
   
• fusableTransitionsConsumingAreExactly :: Maybe Int

  Require exactly this many transitions with exactly one input place, which is exclusively consumed from by that transition. If Nothing, no constraint on fusable transitions consuming.

• fusableTransitionsProducingAreExactly :: Maybe Int

  Require exactly this many transitions with exactly one output place, which is exclusively produced to by that transition. If Nothing, no constraint on fusable transitions producing.

• filterConfig :: FilterConfig