Foundations of Software Science and Computational Structures

DOI10.1007/b106850zbMath1119.68125OpenAlexW1588712707MaRDI QIDQ5705912

Catuscia Palamidessi, Yu-xin Deng

Publication date: 10 November 2005

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

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

Mathematics Subject Classification ID

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

Related Items

Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Quantitative Kleene coalgebras ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Non Expansive ε-Bisimulations ⋮ Remarks on Testing Probabilistic Processes ⋮ Notes on Generative Probabilistic Bisimulation