Algebraic synchronization trees and processes

Luca Aceto, Arnaud Carayol, Z. Ésik, Anna Ingólfsdóttir

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages30-41
Number of pages12
Volume7392 LNCS
EditionPART 2
DOIs
Publication statusPublished - 2012
Event39th International Colloquium on Automata, Languages, and Programming, ICALP 2012 - Warwick, United Kingdom
Duration: Jul 9 2012Jul 13 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume7392 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other39th International Colloquium on Automata, Languages, and Programming, ICALP 2012
CountryUnited Kingdom
CityWarwick
Period7/9/127/13/12

Fingerprint

Synchronization
Recursion
Algebra
Basic Algebra
Process Algebra
Expressive Power
Expressiveness
Categorical
Modulo
Isomorphism
Signature
Equivalence

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Aceto, L., Carayol, A., Ésik, Z., & Ingólfsdóttir, A. (2012). Algebraic synchronization trees and processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 7392 LNCS, pp. 30-41). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7392 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-31585-5-7

Algebraic synchronization trees and processes. / Aceto, Luca; Carayol, Arnaud; Ésik, Z.; Ingólfsdóttir, Anna.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7392 LNCS PART 2. ed. 2012. p. 30-41 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7392 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aceto, L, Carayol, A, Ésik, Z & Ingólfsdóttir, A 2012, Algebraic synchronization trees and processes. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 7392 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 7392 LNCS, pp. 30-41, 39th International Colloquium on Automata, Languages, and Programming, ICALP 2012, Warwick, United Kingdom, 7/9/12. https://doi.org/10.1007/978-3-642-31585-5-7
Aceto L, Carayol A, Ésik Z, Ingólfsdóttir A. Algebraic synchronization trees and processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 7392 LNCS. 2012. p. 30-41. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-642-31585-5-7
Aceto, Luca ; Carayol, Arnaud ; Ésik, Z. ; Ingólfsdóttir, Anna. / Algebraic synchronization trees and processes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7392 LNCS PART 2. ed. 2012. pp. 30-41 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{bd8ff5f776a14a049c409b8f7baaec40,
title = "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.",
author = "Luca Aceto and Arnaud Carayol and Z. {\'E}sik and Anna Ing{\'o}lfsd{\'o}ttir",
year = "2012",
doi = "10.1007/978-3-642-31585-5-7",
language = "English",
isbn = "9783642315848",
volume = "7392 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "30--41",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 2",

}

TY - GEN

T1 - Algebraic synchronization trees and processes

AU - Aceto, Luca

AU - Carayol, Arnaud

AU - Ésik, Z.

AU - Ingólfsdóttir, Anna

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84884188698&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84884188698&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31585-5-7

DO - 10.1007/978-3-642-31585-5-7

M3 - Conference contribution

AN - SCOPUS:84884188698

SN - 9783642315848

VL - 7392 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 30

EP - 41

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -