Compositional weak metrics for group key update

DOI10.4230/LIPIcs.MFCS.2017.72zbMath1441.68146OpenAlexW2739488954MaRDI QIDQ5111289

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

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)

Related Items

A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces, Model independent approach to probabilistic models, Probabilistic divide \& congruence: branching bisimilarity, Unnamed Item, Logical characterization of branching metrics for nondeterministic probabilistic transition systems, A probabilistic calculus of cyber-physical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Weak bisimulation for probabilistic timed automata
• Parametric probabilistic transition systems for system design and analysis
• Probabilistic weak simulation is decidable in polynomial time
• Turning SOS rules into equations
• A logic for reasoning about time and reliability
• A behavioural pseudometric for probabilistic transition systems
• 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
• Computing Behavioral Distances, Compositionally
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• Semantic Analysis of Gossip Protocols for Wireless Sensor Networks
• Game Refinement Relations and Metrics
• Characterising Testing Preorders for Finite Probabilistic Processes
• Formal verification of parallel programs
• Bisimulation can't be traced
• Branching time and abstraction in bisimulation semantics
• Linear Distances between Markov Chains
• Weak Simulation Quasimetric in a Gossip Scenario
• SOS specifications of probabilistic systems by uniformly continuous operators
• Formal verification of timed properties of randomized distributed algorithms
• Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
• Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
• Automata, Languages and Programming
• Optimal Transport