Publication:5111289
From MaRDI portal
DOI10.4230/LIPIcs.MFCS.2017.72zbMath1441.68146MaRDI QIDQ5111289
Ruggero Lanotte, Simone Tini, Massimo Merro
Publication date: 26 May 2020
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, 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, A probabilistic calculus of cyber-physical systems, Logical characterization of branching metrics for nondeterministic probabilistic transition systems
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Weak Simulation Quasimetric in a Gossip Scenario
- 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
