Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Time-abstracted bisimulation: implicit specifications and decidability
Information and Computation
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
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
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
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
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
A Behavioural Pseudometric based on λ--Bisimilarity
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
Hi-index | 0.01 |
In order to describe approximate equivalence between processes, the notion of branching distance has been introduced in the framework of quantitative transition systems. This paper introduces the notion of (@h,@a)-bisimilarity and explores the relationship between it and the branching distance.