Skip to Main content Skip to Navigation
Conference papers

Algebraic synchronization trees and processes

Abstract : We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in the Caucal hierarchy.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Arnaud Carayol Connect in order to contact the contributor
Submitted on : Tuesday, March 5, 2013 - 11:00:25 PM
Last modification on : Saturday, January 15, 2022 - 3:58:10 AM
Long-term archiving on: : Thursday, June 6, 2013 - 3:55:39 AM


Files produced by the author(s)



Luca Aceto, Arnaud Carayol, Zoltan Esik, Anna Ingolfsdottir. Algebraic synchronization trees and processes. International Colloquium on Automata, Languages, and Programming (ICALP 2012), 2012, United Kingdom. pp.30-41, ⟨10.1007/978-3-642-31585-5_7⟩. ⟨hal-00733449⟩



Record views


Files downloads