Algebraic Synchronization Trees and Processes

DOI10.1007/978-3-642-31585-5_7zbMATH Open1318.68118arXiv1610.00450OpenAlexW1825605587MaRDI QIDQ3166997FDOQ3166997

Zoltán Ésik, Anna Ingolfsdottir, Arnaud Carayol, Luca Aceto

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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 Caucal's pushdown hierarchy.

Full work available at URL: https://arxiv.org/abs/1610.00450

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• On the properties of a tree-structured server process
• Algebraic synchronization criterion and computing reset words
• Axiomatizing weighted synchronization trees and weighted bisimilarity
• An algebraic model of synchronous systems
• Continuous Additive Algebras and Injective Simulations of Synchronization Trees

This page was built for publication: Algebraic Synchronization Trees and Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166997)