Algebraic synchronization trees and processes

Authors:
Luca Aceto;Arnaud Carayol;Zoltán Ésik;Anna Ingólfsdóttir
Affiliations:
ICE-TCS, School of Computer Science, Reykjavik University, Iceland;LIGM, Université Paris-Est, CNRS, France;Institute of Informatics, University of Szeged, Hungary;ICE-TCS, School of Computer Science, Reykjavik University, Iceland
Venue:
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Year:
2012

Citing 20
Cited 0

Iteration theories of synchronization trees

Information and Computation
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
An introduction to metric semantics: operational and denotational models for programming and specification languages

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Algebraic Semantics

Algebraic Semantics
On infinite transition graphs having a decidable monadic theory

Theoretical Computer Science
On Infinite Terms Having a Decidable Monadic Theory

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes

Proceedings of the 11th Colloquium on Automata, Languages and Programming
Infinite Results

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Short Introduction to Infinite Automata

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The category-theoretic solution of recursive program schemes

Theoretical Computer Science - Algebra and coalgebra in computer science
Grammars with macro-like productions

SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
An algebraic definition of simulation between programs

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
A Mezei-Wright theorem for categorical algebras

Theoretical Computer Science
A domain equation for bisimulation

Information and Computation
The equational theory of regular words

Information and Computation
Process Algebra: Equational Theories of Communicating Processes

Process Algebra: Equational Theories of Communicating Processes

Quantified Score

Hi-index	0.00

Visualization

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.