safa

Symbolic Algorithms for Finite Automata
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]

Install
Sources
safa-1.4.tgz
md5=0b656277d7c80c04db7b0de26ef24244
Dependencies
ocaml
>= "4.02.0"
Reverse Dependencies
symkat
>= "1.4"