I try as much as possible to implement tools demonstrating the practical usefulness of my work. This page regroups some of these tools.


Distoplan (DISTributed Optimal PLANner) is a tool developed for my PhD. It is based on the theoretical results from our CDC'09 paper and it has been used for obtaining all of our experimental results on planning with message passing algorithms.

Distoplan takes as input a network of (weighted) automata and outputs an optimal plan for the corresponding planning problem (i.e. a path with minimal cost in the product of the automata) in a factored form. Instead of a plan, Distoplan can also output an updated network of automata in which this plan can be found without backtracking.

There exist several versions of Distoplan:


A small tool implemented in Haskell for understanding reachability analysis in timed automata. From a timed automaton, TARea is capable of computing various versions of the region automaton and the zone automaton. It outputs the result in a format that can be displayed using Graphviz. [tarea.tar.gz]


Sunf (SAT UNFolder) is an unfolding tool for planning problems based on an external SAT Solver. It is known that plans can be found by fixing a time horizon and recasting planning problems as SAT problems (see Jussi Rintanen's page for example). At the price of an explosion of the size of the SAT encoding it is possible to use the same idea for building unfoldings of planning problems: trees containing all the reachable states as well as a plan for reaching each of them. Sunf implements this idea as well as a very basic SAT planner. Sunf is written in Scala. [sunf.tar.gz]


LaRA (Lazy Reachability Analyzer) is a tool for reachability analysis in network of automata (see our CONCUR'16 paper for more information). It has been written in Haskell by Didier Lime. I wrote benchmarks generators for LaRA (and some other reachability analysis tools). The tool and generators can be dowloaded here.