On metrics for probabilistic systems: definitions and algorithms

DOI10.1016/J.CAMWA.2008.10.041MaRDI QIDQ971582zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmmetricbehavioral equivalenceprobabilistic systemssimple probabilistic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

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

Cites work

• scientific article; zbMATH DE number 5604066 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1759621 (Why is no real title available?)
• scientific article; zbMATH DE number 1864592 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A behavioural pseudometric for probabilistic transition systems
• A lattice-theoretical fixpoint theorem and its applications
• Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
• Bisimulation through probabilistic testing
• CONCUR 2005 – Concurrency Theory
• Metrics for labelled Markov processes
• New results on quantifier elimination over real closed fields and applications to constraint databases
• Probabilistic automata
• Reactive, generative, and stratified models of probabilistic processes
• Validation of stochastic systems. A guide to current research.

Cited in

(15)

• The complexity of computing a bisimilarity pseudometric on probabilistic automata
• Weak bisimulation metrics in models with nondeterminism and continuous state spaces
• Behavioural pseudometrics for nondeterministic probabilistic systems
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• Behavioural pseudometrics for nondeterministic probabilistic systems
• Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
• A pseudometric in supervisory control of probabilistic discrete event systems
• Computing probabilistic bisimilarity distances for probabilistic automata
• Computing bisimilarity metrics for probabilistic timed automata
• scientific article; zbMATH DE number 1864592 (Why is no real title available?)
• The approximate correctness of systems based on \(\delta\)-bisimulation
• Polynomial-time algorithms for computing distances of fuzzy transition systems
• A behavioural pseudometric for probabilistic transition systems
• CONCUR 2005 – Concurrency Theory
• Approximating and computing behavioural distances in 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)