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 multiva...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.展开更多
基金National Natural Science Foundation of China(No.11371003)Natural Science Foundations of Guangxi,China(No.2011GXNSFA018154,No.2012GXNSFGA060003)+2 种基金Science and Technology Foundation of Guangxi,China(No.10169-1)Scientific Research Project from Guangxi Education Department,China(No.201012MS274)Open Research Fund Program of Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis,China(No.HCIC201301)
文摘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.
