Copyright	Copyright (c) 2020 Ajay Kumar Eeralla
Maintainer	ajay.eeralla@gmail.com
Stability	experimental
Portability	portable
Safe Haskell	Safe
Language	Haskell2010

Data.LTS

Description

This module implements a labelled transition system

Synopsis

data LTSState a = LTSState {
- stateId :: Int
- out :: a
}
data Transition a b = Transition {
- transitionFrom :: LTSState a
- transitionGuard :: b
- transitionTo :: LTSState a
}
type LTS a b = [Transition a b]
checkTrans :: (Eq a, Eq b) => LTSState a -> LTS a b -> Bool
getFromIds :: (Eq a, Eq b) => LTS a b -> [Int]
getToIds :: (Eq a, Eq b) => LTS a b -> [Int]
sortById :: Eq a => [LTSState a] -> [LTSState a]
sortByToSt :: (Eq a, Eq b) => LTS a b -> LTS a b
sortByFromSt :: (Eq a, Eq b) => LTS a b -> LTS a b
collectTrans :: (Eq a, Eq b) => LTSState a -> LTS a b -> Bool -> LTS a b
getStartSt :: (Eq a, Eq b) => LTS a b -> LTSState a
getFinalSt :: (Eq a, Eq b) => LTS a b -> LTSState a
depth :: (Eq a, Eq b) => LTS a b -> LTSState a -> Nat
type Alphabet b = [b]
findTransIndex :: (Eq a, Eq b) => LTSState a -> b -> LTS a b -> Int
transExists :: (Eq a, Eq b) => LTSState a -> b -> LTS a b -> Bool

Documentation

data LTSState a Source #

LTSState is a record type which may hold id, output, etc.

Constructors

LTSState
Fields stateId :: Int out :: a

Instances

Eq a => Eq (LTSState a) Source #
Instance details Defined in Data.LTS Methods (==) :: LTSState a -> LTSState a -> Bool # (/=) :: LTSState a -> LTSState a -> Bool #
Eq a => Ord (LTSState a) Source #	Define Ord instance by id
Instance details Defined in Data.LTS Methods compare :: LTSState a -> LTSState a -> Ordering # (<) :: LTSState a -> LTSState a -> Bool # (<=) :: LTSState a -> LTSState a -> Bool # (>) :: LTSState a -> LTSState a -> Bool # (>=) :: LTSState a -> LTSState a -> Bool # max :: LTSState a -> LTSState a -> LTSState a # min :: LTSState a -> LTSState a -> LTSState a #
Read a => Read (LTSState a) Source #
Instance details Defined in Data.LTS Methods readsPrec :: Int -> ReadS (LTSState a) # readList :: ReadS [LTSState a] # readPrec :: ReadPrec (LTSState a) # readListPrec :: ReadPrec [LTSState a] #
Show a => Show (LTSState a) Source #
Instance details Defined in Data.LTS Methods showsPrec :: Int -> LTSState a -> ShowS # show :: LTSState a -> String # showList :: [LTSState a] -> ShowS #
Generic (LTSState a) Source #
Instance details Defined in Data.LTS Associated Types type Rep (LTSState a) :: Type -> Type # Methods from :: LTSState a -> Rep (LTSState a) x # to :: Rep (LTSState a) x -> LTSState a #
type Rep (LTSState a) Source #
Instance details Defined in Data.LTS type Rep (LTSState a) = D1 (MetaData "LTSState" "Data.LTS" "LTS-0.1.0.0-LMCmeFMnp4HKv6s7g1TTv7" False) (C1 (MetaCons "LTSState" PrefixI True) (S1 (MetaSel (Just "stateId") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int) :*: S1 (MetaSel (Just "out") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))

data Transition a b Source #

Transition models that on a LTSState, given input symbol from an alphabet [b], | takes to the next LTSState

Constructors

Transition
Fields transitionFrom :: LTSState a transitionGuard :: b transitionTo :: LTSState a

Instances

(Eq a, Eq b) => Eq (Transition a b) Source #
Instance details Defined in Data.LTS Methods (==) :: Transition a b -> Transition a b -> Bool # (/=) :: Transition a b -> Transition a b -> Bool #
(Eq a, Eq b) => Ord (Transition a b) Source #	Define Ord instance for `Transition`
Instance details Defined in Data.LTS Methods compare :: Transition a b -> Transition a b -> Ordering # (<) :: Transition a b -> Transition a b -> Bool # (<=) :: Transition a b -> Transition a b -> Bool # (>) :: Transition a b -> Transition a b -> Bool # (>=) :: Transition a b -> Transition a b -> Bool # max :: Transition a b -> Transition a b -> Transition a b # min :: Transition a b -> Transition a b -> Transition a b #
(Read a, Read b) => Read (Transition a b) Source #
Instance details Defined in Data.LTS Methods readsPrec :: Int -> ReadS (Transition a b) # readList :: ReadS [Transition a b] # readPrec :: ReadPrec (Transition a b) # readListPrec :: ReadPrec [Transition a b] #
(Show a, Show b) => Show (Transition a b) Source #
Instance details Defined in Data.LTS Methods showsPrec :: Int -> Transition a b -> ShowS # show :: Transition a b -> String # showList :: [Transition a b] -> ShowS #
Generic (Transition a b) Source #
Instance details Defined in Data.LTS Associated Types type Rep (Transition a b) :: Type -> Type # Methods from :: Transition a b -> Rep (Transition a b) x # to :: Rep (Transition a b) x -> Transition a b #
type Rep (Transition a b) Source #
Instance details Defined in Data.LTS type Rep (Transition a b) = D1 (MetaData "Transition" "Data.LTS" "LTS-0.1.0.0-LMCmeFMnp4HKv6s7g1TTv7" False) (C1 (MetaCons "Transition" PrefixI True) (S1 (MetaSel (Just "transitionFrom") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (LTSState a)) :: (S1 (MetaSel (Just "transitionGuard") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b) :: S1 (MetaSel (Just "transitionTo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (LTSState a)))))