FSM: Basic concepts of finite state machines.

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

Please see the README on GitHub at https://github.com/Pablo-Dominguez/my-stack-fsm-package#readme


[Skip to ReadMe]

Properties

Versions1.0.0, 1.0.0
Change logChangeLog.md
Dependenciesbase (>=4.13 && <5), containers (>=0.5), matrix (>=0.3.6 && <0.4), vector (>=0.12.1 && <0.13) [details]
LicenseBSD-3-Clause
Copyright2020 Pablo Dominguez
AuthorPablo Dominguez
Maintainerpabdombal@alum.us.es
CategoryFSM
Home pagehttps://github.com/Pablo-Dominguez/my-stack-fsm-package#readme
Bug trackerhttps://github.com/Pablo-Dominguez/my-stack-fsm-package/issues
Source repositoryhead: git clone https://github.com/Pablo-Dominguez/my-stack-fsm-package
Uploaded2020-06-07T09:24:38Z by KidKoala

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees


Readme for FSM-1.0.0

[back to package description]

A haskell package in model checking

This is the repo for the package I developed in haskell as the project for my dissertation. The package consists in the following three parts:

FSM.Automata

In this module, we define the data Automata so it is possible to construct an Automata, perform basic operations with it or get information from it.

FSM.States

In this module we strongly use the Data Map package to store information in the states. Although this module may seem simple, it took a lot of hours of designing.

I decided to keep the packages independents from each other so you can use one without having to use the other. Because of this, it is possible to create an AutomataInfo object of an Automata that is not even defined.

FSM.Logic

In this final module, we combine the two previous modules and some functions implemented in them so we can apply the CTL model checking algorithm over the Automata and the AutomataInfo.