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 metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00733449
Contributor : Arnaud Carayol <>
Submitted on : Tuesday, March 5, 2013 - 11:00:25 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:06 PM
Long-term archiving on: : Thursday, June 6, 2013 - 3:55:39 AM

File

algsynchICALPfinal.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

383

Files downloads

655