Processes, Terms and Cycles: Steps on the Road to Infinity

DOI10.1007/11601548zbMath1171.68570OpenAlexW2234185834MaRDI QIDQ5898162

Jun Pang, Yu-xin Deng, Catuscia Palamidessi

Publication date: 13 November 2006

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

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

Mathematics Subject Classification ID

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

Related Items (13)

Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ Quantitative Kleene coalgebras ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Making random choices invisible to the scheduler ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Compositional Methods for Information-Hiding ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Non Expansive ε-Bisimulations ⋮ Remarks on Testing Probabilistic Processes ⋮ Notes on Generative Probabilistic Bisimulation ⋮ Probabilistic Barbed Congruence

This page was built for publication: Processes, Terms and Cycles: Steps on the Road to Infinity