The FC-tools User Manual [1 citations — 0 self]
|
Abstract:
We describe a set of modular extensions to our Auto/Graph verification toolset for networks of communicating processes. These software additions operate from a common file exchange format for automata and networks, called fc2. Tool functionalities comprise graphical depiction of objects, global model construction from hierarchical descriptions, various types of model reductions and of verification of simple modal properties by observers, counterexample production and visualisation. We illustrate typical verification sessions conducted on usual academic examples: dining philosophers, mutual exclusion algorithms and round-robin schedulers. Based on previous experience of drastic state explosion problems we aim here at efficiency in implementation. We use both explicit representation techniques and implicit techniques such as BDDs, with functional overlap at places. Details on internal representations (as C++ classes) and instructions on how to easily program new modular extensions can be found in the companion Implementation Manual.
Citations
| 143 | CCS Expressions, Finite State Processes, and Three Problems of Equivalence – Kanellakis, Smolka - 1983 |
| 41 | Tcl and the Tk Toolkit. Professional Computing Series – Ousterhout - 1994 |
| 27 | Symbolic Bisimulation Minimisation – Bouali, Simone - 1992 |
| 4 | The FC2 Reference Manual, Available by ftp from cma.cma.fr:pub/verif as file fc2refman.ps.gz – Madelaine, Simone - 1993 |
