Approximate analyzing of labeled transition systems
DOI10.1155/2015/963597zbMATH Open1394.68259OpenAlexW2113286936WikidataQ59120076 ScholiaQ59120076MaRDI QIDQ1667079FDOQ1667079
Authors: Qiong Yu, Shihan Yang, Jinzhao Wu 
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/963597
Recommendations
- Approximate equivalence and synchronization of metric transition systems
- Labelled Markov processes: stronger and faster approximations
- scientific article; zbMATH DE number 557977
- Theoretical Aspects of Computing - ICTAC 2004
- Verification of infinite-state dynamic systems using approximate quotient transition systems
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Bisimilar linear systems.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Iterative Solution Methods
- A calculus of communicating systems
- A class of first order factorization methods
- Preconditioning techniques for the solution of the Helmholtz equation by the finite element method
- Inherited LU factorization for solving fuzzy system of linear equations
- Process Algebra
- Exploring probabilistic bisimulations. I
- Branching bisimulation congruence for probabilistic systems
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Schedulability of asynchronous real-time concurrent objects
- Wavelet based ILU preconditioners for the numerical solution by PUFEM of high frequency elastic wave scattering
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- Application of Sparse Matrix Solvers as Effective Preconditioners
- Representing probability measures using probabilistic processes
- Regions of Petri nets with a/sync connections
- Towards a cost-effective ILU preconditioner with high level fill
- Title not available (Why is that?)
- A quantitative doxastic logic for probabilistic processes and applications to information-hiding
- Conformance tests for real-time systems with timed automata specifications
Cited In (4)
- Hyperfinite Approximations to Labeled Markov Transition Systems
- Analysis of the structure of attributed transition systems without hidden transitions
- An approximation algorithm for box abstraction of transition systems on real state spaces
- Approximate equivalence and synchronization of metric transition systems
This page was built for publication: Approximate analyzing of labeled transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667079)
