safa

AuthorDamien Pous <Damien.Pous@ens-lyon.fr>
LicenseGNU LGPL v3
Homepagehttp://perso.ens-lyon.fr/damien.pous/safa/
MaintainerDamien Pous <Damien.Pous@ens-lyon.fr>
Dependencies
&ocamlbuild
ocamlfind
Availableocaml-version >= "4.02.0"
PublishedFeb 2, 2016
Source [http] http://perso.ens-lyon.fr/damien.pous/safa/safa-1.4.tgz
0b656277d7c80c04db7b0de26ef24244
StatisticsInstalled 2 times last month.
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/safa/safa.1.4/opam

Symbolic Algorithms for Finite Automata

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]

Necessary for
symkat
>= 1.4