Axiomatizing weighted synchronization trees and weighted bisimilarity

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We consider regular synchronization trees weighted over a semiring and provide sound and complete axiomatizations of these trees and their weighted bisimulation equivalence classes. We prove that they can be both axiomatized by a finite number of identities relatively to the general axioms of the fixed point operation captured by the notion of iteration theories. We present infinite equational and finite quasi-equational axiomatizations.

Original languageEnglish
Pages (from-to)2-23
Number of pages22
JournalTheoretical Computer Science
Volume534
DOIs
Publication statusPublished - 2014

Fingerprint

Equivalence classes
Axiomatization
Synchronization
Acoustic waves
Semiring
Bisimulation
Equivalence class
Axioms
Fixed point
Iteration
Sound

Keywords

  • Axiomatization
  • Equational theory
  • Iteration theory
  • Synchronization tree
  • Weighted bisimilarity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Axiomatizing weighted synchronization trees and weighted bisimilarity. / Ésik, Z.

In: Theoretical Computer Science, Vol. 534, 2014, p. 2-23.

Research output: Contribution to journalArticle

@article{bd7991344d1d4b95932191a03554036e,
title = "Axiomatizing weighted synchronization trees and weighted bisimilarity",
abstract = "We consider regular synchronization trees weighted over a semiring and provide sound and complete axiomatizations of these trees and their weighted bisimulation equivalence classes. We prove that they can be both axiomatized by a finite number of identities relatively to the general axioms of the fixed point operation captured by the notion of iteration theories. We present infinite equational and finite quasi-equational axiomatizations.",
keywords = "Axiomatization, Equational theory, Iteration theory, Synchronization tree, Weighted bisimilarity",
author = "Z. {\'E}sik",
year = "2014",
doi = "10.1016/j.tcs.2014.02.033",
language = "English",
volume = "534",
pages = "2--23",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Axiomatizing weighted synchronization trees and weighted bisimilarity

AU - Ésik, Z.

PY - 2014

Y1 - 2014

N2 - We consider regular synchronization trees weighted over a semiring and provide sound and complete axiomatizations of these trees and their weighted bisimulation equivalence classes. We prove that they can be both axiomatized by a finite number of identities relatively to the general axioms of the fixed point operation captured by the notion of iteration theories. We present infinite equational and finite quasi-equational axiomatizations.

AB - We consider regular synchronization trees weighted over a semiring and provide sound and complete axiomatizations of these trees and their weighted bisimulation equivalence classes. We prove that they can be both axiomatized by a finite number of identities relatively to the general axioms of the fixed point operation captured by the notion of iteration theories. We present infinite equational and finite quasi-equational axiomatizations.

KW - Axiomatization

KW - Equational theory

KW - Iteration theory

KW - Synchronization tree

KW - Weighted bisimilarity

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

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

U2 - 10.1016/j.tcs.2014.02.033

DO - 10.1016/j.tcs.2014.02.033

M3 - Article

VL - 534

SP - 2

EP - 23

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -