Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Modelling.PetriNet.Reach.Deadlock
Description
originally from Autotool (https:/gitlab.imn.htwk-leipzig.deautotool/all0) based on revision: ad25a990816a162fdd13941ff889653f22d6ea0a based on file: collectionsrcPetri/Deadlock.hs
Documentation
verifyDeadlock :: (OutputCapable m, Show a, Show t, Ord t, Ord a) => DeadlockInstance a t -> LangM m Source #
deadlockTask :: (MonadCache m, MonadDiagrams m, MonadGraphviz m, MonadThrow m, Ord s, Ord t, OutputCapable m, Show s, Show t) => FilePath -> DeadlockInstance s t -> LangM m Source #
deadlockSyntax :: OutputCapable m => DeadlockInstance Place Transition -> [Transition] -> LangM m Source #
deadlockEvaluation :: (Alternative m, MonadCache m, MonadDiagrams m, MonadGraphviz m, MonadThrow m, OutputCapable m) => FilePath -> DeadlockInstance Place Transition -> [Transition] -> Rated m Source #
deadlockSolution :: Ord s => DeadlockInstance s t -> [t] Source #
data DeadlockInstance s t Source #
Constructors
DeadlockInstance | |
Fields
|
Instances
bimapDeadlockInstance :: (Ord a, Ord b) => (s -> a) -> (t -> b) -> DeadlockInstance s t -> DeadlockInstance a b Source #
toShowDeadlockInstance :: DeadlockInstance Place Transition -> DeadlockInstance ShowPlace ShowTransition Source #
data DeadlockConfig Source #
Constructors
DeadlockConfig | |
Fields
|
Instances
generateDeadlock :: (MonadCatch m, MonadDiagrams m, MonadGraphviz m) => DeadlockConfig -> Int -> m (DeadlockInstance Place Transition) Source #
tries :: (MonadCatch m, MonadDiagrams m, MonadGraphviz m) => Int -> DeadlockConfig -> Int -> m (Net Place Transition, GraphvizCommand) Source #
try :: MonadRandom m => DeadlockConfig -> m [(Int, Net Place Transition)] Source #