The Fc2Tools set (tool demonstration)
The Auto/Graph toolset developed in our group was a pioneering software for analysis and verification of networks of communicating processes. We describe here the next-generation Auto/Graph, consisting of a modular tool suite interfaced around a common file description format named Fc2. The format allows representation of single reactive automata as well as combining networks. This format was developed in the scope of Esprit BRA project 7166:Concur2.
In the new implementation, most analysis functions are implemented with redundancy using both explicit classical representation of automata, and also implicit state space symbolic representation using Binary Decision Diagrams. The two alternative techniques offer drastically different performances in different cases, and having both at hand in a unified framework is a valuable thing.
Both Fc2Explicit and Fc2Implicit commands perform synchronised product and reachable state space search. They can minimize results w.r.t. strong, weak, branching bisimulation notions, and produce the result as an Fc2 automaton. They can also abstract the system with a notion of “abstract actions”, each synthesizing a set of sequences of concrete behaviours (in this sense behavioural abstraction can be seen as reverse from refinement). In addition Fc2Implicit has a fast checker for deadlocks, live-lock or divergent states, for which it produces counterexample paths in case of existence, while Fc2Explicit allows compositional reduction techniques, mostly in case of “observational” bisimulation minimisations. Several extensions are still underway.
The tool suite is completed by the graphical editor Autograph, which allows for graphical depiction of automata and networks as well as recollection of some form of results.
The toolset is available by anonymous ftp. Information can be obtained from the WWW page http://cma.cma.fr/Verification/verif-eng.html, or by e-mailing to firstname.lastname@example.org.