Name

reachelm — Eliminates summands by proving that they are not reachable

Synopsis

reachelm [-help] [-help-all] [-version] [-summand n] [-silent] [-print] [-counter] [Data Options] [Rewriter Options] [input.tbf]

Description

This filter reads from input.tbf (or stdin if not given) an LPE in .tbf format and tries to remove summands.

reachelm marks in a breadth-first search all summands that might be enabled in the initial state or by enabled summands. All unmarked summands are removed. The output reflects a minimal execution from the initial state to the preserved summands.

Given parameters x, and summands

sum (ei, ai(fi) . P(gi) <| hi |> delta )
sum (ej, aj(fj) . P(gj) <| hj |> delta )

summand j is enabled by summand i if: exists x,ei . ( hi(x,ei) implies exists ej . hj(gi(x,ei),ej) )

The LPE will be written to stdout.

Options

-help

Display help information

-help-all

Display all help information

-version

Get the version number of this release

-summand n

Try to remove only summand n

-silent

Suppress information per summand

-print

Print resulting BDDs (use for small examples only)

-counter

Print counter examples

Last update

16 December 2008 by Bert Lisser