Approximate Failures Semantics for Polynomial Labelled Transition Systems

Labelled transition systems （LTSs） are widely used to formally describe system behaviour. The labels of LTS are extended to offer a more satisfactory description of behaviour by refining the abstract labels into multivariate polynomials. These labels can be simplified by numerous numerical approximation methods. Those LTSs that can not apply failures semantics equivalence in description and verification may have a chance after using approximation on labels. The technique that combines approximation and failures semantics equivalence effectively alleviates the computational complexity and minimizes LTS.