Description

This OCaml library contains symbolic algorithms for checking language equivalence or inclusion of automata with a large alphabet, using symbolic representations (BDDs).

It is described in the following paper, in Proc. POPL'15 http://doi.acm.org/10.1145/2676726.2677007 https://hal.archives-ouvertes.fr/hal-01021497v2/document

This library can be used to obtain symbolic algorithms for Kleene algebra with tests (KAT), see library [symkat]

Published: 02 Feb 2016

Dependencies (3)

  1. ocamlbuild build
  2. ocamlfind build
  3. ocaml >= "4.02.0"

Reverse Dependencies (1)

  1. symkat >= "1.4"

Conflicts

    None
Symbolic Algorithms for Finite Automata

Install

Documentation perso.ens-lyon.fr Edit opam file

Authors

  1. D
    Damien Pous <Damien.Pous@ens-lyon.fr>

Maintainers

  1. D
    Damien Pous <Damien.Pous@ens-lyon.fr>

Sources

safa-1.4.tgz
md5=0b656277d7c80c04db7b0de26ef24244