Approximate analyzing of labeled transition systems
type: Item
instance of: scholarly article
title: Approximate analyzing of labeled transition systems
zbMATH Open document ID: 1394.68259
DOI: 10.1155/2015/963597
author: Qiong Yu
author: Shihan Yang
author: Jinzhao Wu
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: As the most important formal semantic model, labeled transition systems are widely used, which can describe the general concurrent systems or control systems without disturbance. However, under normal circumstance, transition systems are complex and difficult to use due to large amount of calculation and the state space explosion problems. In order to overcome these problems, approximate equivalent labeled transition systems are proposed by means of incomplete low-up matrix decomposition factorization. This technique can reduce the complexity of computation and calculate under the allowing errors. As for continuous-time linear systems, we develop a modeling method of approximated transition system based on the approximate solution of matrix, which provides a facility for approximately formal semantic modeling for linear systems and to effectively analyze errors. An example of application in the context of linear systems without disturbances is studied.
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 6927707
Wikidata QID: Q59120076
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/963597
OpenAlex ID: W2113286936
cites work: Regions of Petri nets with a/sync connections
cites work: A calculus of communicating systems
cites work: Q3992568
cites work: Q3777424
cites work: Process Algebra
cites work: Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
cites work: A quantitative doxastic logic for probabilistic processes and applications to information-hiding
cites work: Q5151036
cites work: Representing probability measures using probabilistic processes
cites work: Exploring probabilistic bisimulations. I
cites work: Branching bisimulation congruence for probabilistic systems
cites work: Conformance tests for real-time systems with timed automata specifications
cites work: Schedulability of asynchronous real-time concurrent objects
cites work: Preconditioning techniques for the solution of the Helmholtz equation by the finite element method
cites work: Towards a cost-effective ILU preconditioner with high level fill
cites work: Application of Sparse Matrix Solvers as Effective Preconditioners
cites work: An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
cites work: A class of first order factorization methods
cites work: Inherited LU factorization for solving fuzzy system of linear equations
cites work: Wavelet based ILU preconditioners for the numerical solution by PUFEM of high frequency elastic wave scattering
cites work: Q5687941
cites work: Iterative Solution Methods
cites work: Bisimilar linear systems.
description: scientific article; zbMATH DE number 6927707