CONCUR 2003 - Concurrency Theory

DOI10.1007/B11938zbMath1274.68227OpenAlexW105220891MaRDI QIDQ5900586

Alessandra Di Pierro, Herbert Wiklicky, Chris Hankin

Publication date: 30 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11938

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Value-passing CCS with noisy channels ⋮ Reversible monadic computing ⋮ The approximate correctness of systems based on \(\delta\)-bisimulation ⋮ A Behavioural Pseudometric based on λ–Bisimilarity ⋮ Approximate bisimulation: a bridge between computer science and control theory ⋮ A unified framework for differential aggregations in Markovian process algebra ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Measuring the confinement of probabilistic systems ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Tempus fugit: How to plug it ⋮ Quantitative Abstractions for Collective Adaptive Systems ⋮ On finite-state approximants for probabilistic computation tree logic ⋮ On Probabilistic Techniques for Data Flow Analysis

This page was built for publication: CONCUR 2003 - Concurrency Theory