CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68458OpenAlexW1737342522MaRDI QIDQ5897480

Franck Van Breugel

Publication date: 1 November 2006

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

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

Mathematics Subject Classification ID

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

Related Items (13)

Recursively defined metric spaces without contraction ⋮ General quantitative specification theories with modal transition systems ⋮ A framework to measure the robustness of programs in the unpredictable environment ⋮ The quantitative linear-time-branching-time spectrum ⋮ A modal characterization of alternating approximate bisimilarity ⋮ A quantified coalgebraic van Benthem theorem ⋮ A Behavioural Pseudometric based on λ–Bisimilarity ⋮ Approximate bisimulation: a bridge between computer science and control theory ⋮ On metrics for probabilistic systems: definitions and algorithms ⋮ Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ A Probability Monad as the Colimit of Spaces of Finite Samples ⋮ How adaptive and reliable is your program?

Uses Software

• Casper

This page was built for publication: CONCUR 2005 – Concurrency Theory