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

DOI10.1007/11601548zbMath1171.68558OpenAlexW2234185834MaRDI QIDQ5898163

W. J. Fokkink, Anna Ingólfsdóttir, Luca Aceto, Bas Luttik

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 (15)

The Equational Theory of Weak Complete Simulation Semantics over BCCSP ⋮ Axiomatizing recursion-free, regular monitors ⋮ Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ On the axiomatisability of priority. III: Priority strikes again ⋮ Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction ⋮ Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ On finite alphabets and infinite bases ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences ⋮ Rule formats for distributivity ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Ready to preorder: the case of weak process semantics ⋮ On the Unification of Process Semantics: Equational Semantics ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP

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