Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
An Algorithm for Quantitative Verification of Probabilistic Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Metrics for finite Markov decision processes
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Recursively defined metric spaces without contraction
Theoretical Computer Science
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Probabilistic supervisory control of probabilistic discrete event systems
Probabilistic supervisory control of probabilistic discrete event systems
| Hi-index | 0.00 |
The focus of this paper is the pseudometric used as a key concept in our previous work on optimal supervisory control of probabilistic discrete event systems. The pseudometric is employed to measure the behavioural similarity between probabilistic systems, and initially was defined as a greatest fixed point of a monotone function. This paper further characterizes the pseudometric. First, it gives a logical characterization of the pseudometric so that the distance between two systems is measured by a formula that distinguishes between the systems the most. A trace characterization of the pseudometric is then derived from the logical characterization, characterizing the similarity between systems from a language perspective. Further, the solution of the problem of approximation of a given probabilistic generator with another generator of a prespecified structure is suggested such that the new model is as close as possible to the original one in the pseudometric. The significance of the approximation is then discussed, especially with respect to previous work on optimal supervisory control of probabilistic discrete event systems.