/automata-model

Haskell app that uses finite automata to verify the correctness of specs.

Primary LanguageHaskellBSD 3-Clause "New" or "Revised" LicenseBSD-3-Clause

automata-model

CSE 355 project to validate requirements through Finite Automata.

Eric Arellano, ecarell1

Prerequisites

  1. Haskell Stack

To install

Assumes Haskell Stack installed.

  1. stack setup

To run

  1. stack build
  2. stack exec automata-model-exe [path-to-input.txt]

REPL

  1. stack ghci
  2. :set args [path-to-input.txt]
  3. main
Update project

:r

Quit REPL

:q

Assumptions

  1. It is okay to renumber the states when converting from NFA -> DFA or taking the intersection.