Axiomatizing weighted synchronization trees and weighted bisimilarity

Research output: Contribution to journalArticle

4 Citations (Scopus)


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
Publication statusPublished - Jan 1 2014


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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Axiomatizing weighted synchronization trees and weighted bisimilarity'. Together they form a unique fingerprint.

  • Cite this