Compositional weak metrics for group key update

DOI10.4230/LIPICS.MFCS.2017.72zbMATH Open1441.68146OpenAlexW2739488954MaRDI QIDQ5111289FDOQ5111289

Ruggero Lanotte, Simone Tini, Massimo Merro

Publication date: 26 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#LanotteMT17

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

zbMATH Keywords

compositional reasoningbehavioural metricgroup key update

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Optimal Transport
• Title not available (Why is that?)
• Bisimulation can't be traced
• A logic for reasoning about time and reliability
• Metrics for labelled Markov processes
• Formal verification of parallel programs
• Branching time and abstraction in bisimulation semantics
• A behavioural pseudometric for probabilistic transition systems
• Title not available (Why is that?)
• Game Refinement Relations and Metrics
• Characterising Testing Preorders for Finite Probabilistic Processes
• Title not available (Why is that?)
• Probabilistic weak simulation is decidable in polynomial time
• Probabilistic extensions of process algebras.
• Turning SOS rules into equations
• Automata, Languages and Programming
• Formal verification of timed properties of randomized distributed algorithms
• Title not available (Why is that?)
• Weak bisimulation for probabilistic timed automata
• Computing Behavioral Distances, Compositionally
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• Title not available (Why is that?)
• Weak Simulation Quasimetric in a Gossip Scenario
• Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
• Parametric probabilistic transition systems for system design and analysis
• The quantitative linear-time-branching-time spectrum
• A general SOS theory for the specification of probabilistic transition systems
• Converging from Branching to Linear Metrics on Markov Chains
• Linear Distances between Markov Chains
• SOS specifications of probabilistic systems by uniformly continuous operators
• Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
• Semantic Analysis of Gossip Protocols for Wireless Sensor Networks

Cited In (6)

• 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
• A probabilistic calculus of cyber-physical systems
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• Title not available (Why is that?)

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)