New Analysis Algorithm: STC Scenario Released

A new analysis algorithm is available on the SpaceEx platform: The STC scenario produces fewer convex sets for a given accuracy and computes more precise images of discrete transitions.

The STC scenario is an algorithm for approximating flowpipes that has just been submitted for publication. Based on the LGG scenario, the reachable states over time (so-called flowpipes) are bounded with piecewise linear approximations of the support function over time. The approximation can be made arbitrarily precise using just two parameters: the number of template directions and an error bound that is evaluated in each of those directions. The image of discrete transitions is computed on polyhedral overapproximations, whose complexity (number of constraints) and number is adjusted automatically so a given error bound is met. This makes clustering heuristics (commonly used with the LGG scenario) unnecessary in most cases and gives more predictable results than the hit-or-miss success rate of such heuristics. A small comparison between STC and LGG scenarios is available here.

The STC scenario is available as part of SpaceEx release v0.9.7c, which also includes a number of minor bugfixes and performance improvements. Download SpaceEx v0.9.7c.