Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Communication and Concurrency
Automata, Languages, and Machines
Automata, Languages, and Machines
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
Probabilistic Metric Semantics for a Simple Language with Recursion
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
CCS + Time = An Interleaving Model for Real Time Systems
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
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
Axiomatizations for probabilistic finite-state behaviors
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Recursively defined metric spaces without contraction
Theoretical Computer Science
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
On metrics for probabilistic systems: Definitions and algorithms
Computers & Mathematics with Applications
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
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
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Information flow in interactive systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Two-thirds simulation indexes and modal logic characterization
Frontiers of Computer Science in China
Value-passing CCS with noisy channels
Theoretical Computer Science
On behavioural pseudometrics and closure ordinals
Information Processing Letters
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
Bisimulation for Quantum Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Quantitative information flow in interactive systems
Journal of Computer Security - ARSPA-WITS'10
| Hi-index | 0.01 |
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural extension of bisimulation from non-quantitative systems to quantitative ones. We then prove that any single state-metric corresponds to a bisimulation and that the greatest state-metric corresponds to bisimilarity. Furthermore, we provide two extended examples which show that our results apply to both probabilistic and weighted automata as special cases of action-labelled quantitative transition systems.