Compositional weak metrics for group key update
From MaRDI portal
Publication:5111289
Recommendations
- Compositional metric reasoning with probabilistic process calculi
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Weak simulation quasimetric in a gossip scenario
- Fixed-point characterization of compositionality properties of probabilistic processes combinators
- Up-to techniques for generalized bisimulation metrics
Cites work
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 2038772 (Why is no real title available?)
- scientific article; zbMATH DE number 1927572 (Why is no real title available?)
- scientific article; zbMATH DE number 1927573 (Why is no real title available?)
- A behavioural pseudometric for probabilistic transition systems
- A general SOS theory for the specification of probabilistic transition systems
- A logic for reasoning about time and reliability
- Automata, Languages and Programming
- Axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules
- Bisimulation can't be traced
- Branching time and abstraction in bisimulation semantics
- Characterising Testing Preorders for Finite Probabilistic Processes
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Computing behavioral distances, compositionally
- Converging from Branching to Linear Metrics on Markov Chains
- Fixed-point characterization of compositionality properties of probabilistic processes combinators
- Formal verification of parallel programs
- Formal verification of timed properties of randomized distributed algorithms
- Game Refinement Relations and Metrics
- Linear distances between Markov chains
- Metrics for labelled Markov processes
- Optimal Transport
- Parametric probabilistic transition systems for system design and analysis
- Probabilistic extensions of process algebras.
- Probabilistic weak simulation is decidable in polynomial time
- Semantic analysis of gossip protocols for wireless sensor networks
- Sós specifications of probabilistic systems by uniformly continuous operators
- The quantitative linear-time-branching-time spectrum
- Turning SOS rules into equations
- Upper-expectation bisimilarity and Łukasiewicz \(\mu \)-calculus
- Weak bisimulation for probabilistic timed automata
- Weak simulation quasimetric in a gossip scenario
Cited in
(7)
- Probabilistic divide \& congruence: branching bisimilarity
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- Model independent approach to probabilistic models
- Equational reasonings in wireless network gossip protocols
- Weak simulation quasimetric in a gossip scenario
- A probabilistic calculus of cyber-physical systems
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
This page was built for publication: Compositional weak metrics for group key update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111289)