Table of Contents

Details of Use Cases

A. Preparing Büchi automaton diagrams for slides/papers/homework

B. Checking correctness of a hand-drawn Büchi automaton

Whether a hand-drawn automaton is correct, with respect to a QPTL (or PTL if it suffices) formula, can be verified using either of the following two methods:

C. “Hand-optimization” of a specification Büchi automaton

Though it is essentially a trial-and-error process, the equivalence test provided by GOAL will greatly ease the pain.

D. Combining GOAL with SPIN

E. Checking correctness of a Büchi complementation algorithm

The random automata generation and the equivalence checking are built-in functions of GOAL.

[Sample Code]

F. Utilizing the Büchi Store


Other uses are, of course, possible.