Distances between processes: a pure algebraic approach

DOI10.1007/978-3-642-37635-1_16zbMATH Open1394.68219OpenAlexW7067989MaRDI QIDQ2848889FDOQ2848889

Authors: David Romero Hernández, David de Frutos Escrig 

Publication date: 13 September 2013

Published in: Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37635-1_16

Recommendations

• Distances for weighted transition systems: games and properties
• Metrics for weighted transition systems: axiomatization and complexity
• Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity
• An algebra of processes
• scientific article; zbMATH DE number 1735902

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)

Cited In (1)

• Compositionality for quantitative specifications

This page was built for publication: Distances between processes: a pure algebraic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848889)