Algebraic synchronization trees and processes

Luca Aceto (1) , Arnaud Carayol (2) , Zoltan Esik (3) , Anna Ingolfsdottir (1)

1 School of Computer Science [Reykjavik]
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 Institute of Informatics

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.

Domaines: Logiciel mathématique [cs.MS]

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⟩