LTS: LTS: Labelled Transition System

[ library, mit, program, state-machines ] [ Propose Tags ]

This is an implementation of labelled transition system and follow the README for information on importing and getting started.

[Skip to Readme]


[Index] [Quick Jump]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS]
Change log
Dependencies base (>= && <5), fin (>=0.1.1 && <0.2), LTS [details]
License MIT
Copyright ©2020 Ajay Kumar Eeralla
Author Ajay Kumar Eeralla
Category State Machines
Source repo head: git clone
Uploaded by ajayeeralla at 2020-04-08T18:40:31Z
Executables LTS
Downloads 299 total (1 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2020-04-08 [all 1 reports]

Readme for LTS-

[back to package description]

LTS: Labelled Transition System

Travis MIT license

This is a library that implements a labelled transition system that can be either deterministic or non-deterministic.


Here is an example to use LTS library:

import Data.LTS

main = do
    let s0 :: LTSState Int = LTSState {stateId=0, out=3}
    let s1 :: LTSState Int = LTSState {stateId=1, out=5}
    let s2 :: LTSState Int = LTSState {stateId=2, out=7}
    let t1 :: Transition Int Char = Transition {transitionFrom=s0, transitionGuard='a', transitionTo=s1}
    let t2 :: Transition Int Char = Transition {transitionFrom=s1, transitionGuard='b', transitionTo=s2}

    putStrLn "depth of LTS [t1, t2]:"
    print (depth [t1, t2] s0)