Approximate Analyzing of Labeled Transition Systems

Abstract EN

As the most important formal semantic model, labeled transition systems arewidely used, which can describe the general concurrent systems or control systemswithout disturbance.

However, under normal circumstance, transition systemsare complex and difficult to use due to large amount of calculation and the statespace explosion problems.

In order to overcome these problems, approximateequivalent labeled transition systems are proposed by means of incomplete low-upmatrix decomposition factorization.

This technique can reduce the complexity ofcomputation and calculate under the allowing errors.

As for continuous-time linearsystems, we develop a modeling method of approximated transition system basedon the approximate solution of matrix, which provides a facility for approximatelyformal semantic modeling for linear systems and to effectively analyze errors.

An example of application in the context of linear systems without disturbances isstudied.