Algebraic synchronization trees and processes
From MaRDI portal
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.
Recommendations
Cited in
(9)- An algebraic model of synchronous systems
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- On the properties of a tree-structured server process
- A (Co)Algebraic Analysis of Synchronization in CSP
- Continuous Additive Algebras and Injective Simulations of Synchronization Trees
- Generalized synchronization trees
- Representing guardedness in call-by-value and guarded parametrized monads
- A unifying categorical view of nondeterministic iteration and tests
- The structure of trees in the pushdown hierarchy
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)