Approximate analyzing of labeled transition systems
From MaRDI portal
Publication:1667079
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
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 7311343 (Why is no real title available?)
- scientific article; zbMATH DE number 960150 (Why is no real title available?)
- A calculus of communicating systems
- A class of first order factorization methods
- A quantitative doxastic logic for probabilistic processes and applications to information-hiding
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- Application of Sparse Matrix Solvers as Effective Preconditioners
- Bisimilar linear systems.
- Branching bisimulation congruence for probabilistic systems
- Conformance tests for real-time systems with timed automata specifications
- Exploring probabilistic bisimulations. I
- Inherited LU factorization for solving fuzzy system of linear equations
- Iterative Solution Methods
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Preconditioning techniques for the solution of the Helmholtz equation by the finite element method
- Process Algebra
- Regions of Petri nets with a/sync connections
- Representing probability measures using probabilistic processes
- Schedulability of asynchronous real-time concurrent objects
- Towards a cost-effective ILU preconditioner with high level fill
- Wavelet based ILU preconditioners for the numerical solution by PUFEM of high frequency elastic wave scattering
Cited in
(4)- Hyperfinite Approximations to Labeled Markov Transition Systems
- An approximation algorithm for box abstraction of transition systems on real state spaces
- Approximate equivalence and synchronization of metric transition systems
- Analysis of the structure of attributed transition systems without hidden transitions
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)