Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Handbook of logic in computer science (vol. 1)
Characteristic formulae for processes with divergence
Information and Computation
David Michael Ritchie Park (1935–1990) in memoriam
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Handbook of logic in computer science (vol. 4)
Communication and Concurrency
Bisimulation indexes and their applications
Theoretical Computer Science
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Towards Quantitative Verification of Probabilistic Transition Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Category Theory and Computer Science
Bisimulation: From The Origins to Today
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Approximate Reasoning for Real-Time Probabilistic Processes
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
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
Recursively defined metric spaces without contraction
Theoretical Computer Science
Quantifying process equivalence based on observed behavior
Data & Knowledge Engineering
Characterize branching distance in terms of (η,α)-bisimilarity
Information and Computation
A Behavioural Pseudometric based on λ--Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantifying Timing Leaks and Cost Optimisation
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
An algebra of quantum processes
ACM Transactions on Computational Logic (TOCL)
On metrics for probabilistic systems: Definitions and algorithms
Computers & Mathematics with Applications
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Process equivalence: comparing two process models based on observed behavior
BPM'06 Proceedings of the 4th international conference on Business Process Management
Evaluation of technical measures for workflow similarity based on a pilot study
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
| Hi-index | 0.00 |
Metric labelled transition systems are labelled transition systems whose states and actions form (pseudo)metric spaces. These systems can capture a large class of timed transition systems, including systems with uncountably many states and uncountable nondeterminism. In this paper a behavioural pseudometric is introduced for metric labelled transition systems. The behavioural distance between states, a nonnegative real number, captures the similarity of the behaviour of those states. The smaller the distance, the more alike the states are. In particular, the distance between states is 0 iff they are bisimilar. Three different characterisations of this pseudometric are given: a fixed point, a logical and a coinductive characterisation. These generalise the fixed point, logical and coinductive characterisations of bisimilarity.