Safe Haskell	Safe-Inferred
Language	Haskell2010

Modelling.PetriNet.Reach.Step

Description

originally from Autotool (https:/gitlab.imn.htwk-leipzig.deautotool/all0) based on revision: ad25a990816a162fdd13941ff889653f22d6ea0a based on file: collectionsrcPetri/Step.hs

Synopsis

deadlocks :: Ord s => Net s t -> [[State s]]
deadlocks' :: Ord s => Net s t -> [[(State s, [t])]]
levels :: Ord s => Net s t -> [[State s]]
levels' :: Ord s => Net s t -> [[(State s, [t])]]
equalling :: Eq a => (t -> a) -> t -> t -> Bool
executes :: (Alternative m, MonadCache m, MonadDiagrams m, MonadGraphviz m, MonadThrow m, Ord s, Ord t, OutputCapable m, Show s, Show t) => FilePath -> GraphvizCommand -> Net s t -> [t] -> LangM' m (Either Int (State s))
executeIO :: (MonadCache m, MonadDiagrams m, MonadGraphviz m, MonadThrow m, Ord a, Ord k, OutputCapable m, Show a, Show k) => FilePath -> GraphvizCommand -> Net k a -> a -> State k -> LangM' m (State k)
execute :: (Monad m, Ord a, Ord k, OutputCapable m, Show a, Show k) => Net k a -> a -> State k -> LangM' m (State k)
successors :: Ord s => Net s t -> State s -> [(t, State s)]
change :: Ord s => (Int -> Int) -> [s] -> State s -> State s

Documentation

deadlocks :: Ord s => Net s t -> [[State s]] Source #

deadlocks' :: Ord s => Net s t -> [[(State s, [t])]] Source #

The returned trace for each state is in reversed order, i.e., undoing the firing on the returned deadlock state in order of the returned transitions list leads to the initial state of the net. (Only states of and traces to deadlocks are returned.)

levels :: Ord s => Net s t -> [[State s]] Source #

levels' :: Ord s => Net s t -> [[(State s, [t])]] Source #

The returned trace for each state is in reversed order, i.e., undoing the firing on the returned target state in order of the returned transitions list leads to the initial state of the net.

equalling :: Eq a => (t -> a) -> t -> t -> Bool Source #

executes :: (Alternative m, MonadCache m, MonadDiagrams m, MonadGraphviz m, MonadThrow m, Ord s, Ord t, OutputCapable m, Show s, Show t) => FilePath -> GraphvizCommand -> Net s t -> [t] -> LangM' m (Either Int (State s)) Source #

executeIO :: (MonadCache m, MonadDiagrams m, MonadGraphviz m, MonadThrow m, Ord a, Ord k, OutputCapable m, Show a, Show k) => FilePath -> GraphvizCommand -> Net k a -> a -> State k -> LangM' m (State k) Source #

execute :: (Monad m, Ord a, Ord k, OutputCapable m, Show a, Show k) => Net k a -> a -> State k -> LangM' m (State k) Source #

successors :: Ord s => Net s t -> State s -> [(t, State s)] Source #

change :: Ord s => (Int -> Int) -> [s] -> State s -> State s Source #