
The event-based automaton projection takes an automaton and a subset of the events of its alphabet that should be preserved. The other events of the alphabet are considered to be internal steps and get replaced by epsilon at the edges. The algorithm produces a deterministic automaton with the subset as its alphabet that has the same language.
The tool takes a .cif file containing a single automaton, and the names of the events that should be preserved. The output is a .cif file containing a deterministic automaton that is language equivalent with the input automaton with respect to the set of preserved events. The resulting automaton has the same kind as the input automaton.
The tool can be started in the following ways:
Besides the general application options, this application has the following options: