Contractions in comparing concurrency semantics
Theoretical Computer Science
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Comparative Metric Semantics of Programming
Comparative Metric Semantics of Programming
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Real-Time Behaviour of Asynchronous Agents
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Approximate abstraction of stochastic hybrid automata
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Value-passing CCS with noisy channels
Theoretical Computer Science
Approximating Markov processes through filtration
Theoretical Computer Science
Approximating Bisimilarity for Markov Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We introduce a notion of approximate bisimilarity in order to be able to reason about the approximate equivalence of processes. Approximate bisimilarity is based on the notion of bisimulation index for labelled transition systems. We establish some basic properties of bisimulation indexes and give a Hennessy-Milner logical characterization of approximate bisimilarity. As an application we show how to describe approximate correctness of real time systems by giving an example in real time ACP.