[Caml-list] [ANN] LASCAr - A library for manipulating Labeled Transition Systems

[Caml-list] [ANN] LASCAr - A library for manipulating Labeled Transition Systems

[Jocelyn Sérot]

I'm pleased to announce the first release of LASCAr, an OCaml library for manipulating Labeled Transition Systems.

The library provides, in particular, functions for
- building and inspecting models of such systems
- generating graphical (`.dot` format) and text (`.tex` format) representations
- computing execution trees and displaying them in graphical or text format
- computing the product (in various flavors) of such systems

Its provides implementations both for "generic" LTS (with or without state attributes) and for "specialized" versions such as
- deterministic and non-deterministic finite automata (DFA, NFA),
- Mealy and Moore automata
- Finite State Machines (FSMs)

The source code, documentation and some examples can be downloaded from GitHub at : 

https://github.com/jserot/lascar

For a quick glance, some annotated code snippets are available here

http://htmlpreview.github.io/?https://github.com/jserot/lascar/blob/master/doc/examples/examples.html

The API is documented here 

http://htmlpreview.github.io/?https://github.com/jserot/lascar/blob/master/doc/api/lascar.html

Contributions are welcome since this kind of library is, due to pervasive nature of LTS, highly extensible in many ways.
[please note that, since i’m new to GitHub, any advice on how to handle this would be appreciated].

J. Sérot