On metrics for probabilistic systems: definitions and algorithms
DOI10.1016/J.CAMWA.2008.10.041zbMATH Open1186.68250OpenAlexW2091451423MaRDI QIDQ971582FDOQ971582
Authors: Taolue Chen, Tingting Han, Jian Lu 
Publication date: 16 May 2010
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/on-metrics-for-probabilistic-systems-definitions-and-algorithms(a96d207c-0db3-418f-8c20-23b5ec0ee9a4).html
Recommendations
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
- Approximating and computing behavioural distances in probabilistic transition systems
- A behavioural pseudometric for probabilistic transition systems
- Behavioural pseudometrics for nondeterministic probabilistic systems
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Probabilistic automata
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Title not available (Why is that?)
- Metrics for labelled Markov processes
- Title not available (Why is that?)
- Reactive, generative, and stratified models of probabilistic processes
- A behavioural pseudometric for probabilistic transition systems
- New results on quantifier elimination over real closed fields and applications to constraint databases
- CONCUR 2005 – Concurrency Theory
- Validation of stochastic systems. A guide to current research.
- Title not available (Why is that?)
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Cited In (13)
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
- CONCUR 2005 – Concurrency Theory
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- Title not available (Why is that?)
- The approximate correctness of systems based on \(\delta\)-bisimulation
- Weak bisimulation metrics in models with nondeterminism and continuous state spaces
- Behavioural pseudometrics for nondeterministic probabilistic systems
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- Approximating and computing behavioural distances in probabilistic transition systems
- A pseudometric in supervisory control of probabilistic discrete event systems
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Computing probabilistic bisimilarity distances for probabilistic automata
- A behavioural pseudometric for probabilistic transition systems
This page was built for publication: On metrics for probabilistic systems: definitions and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971582)
