Axiomatizing weighted synchronization trees and weighted bisimilarity

作者：Esik Z^*

来源：Theoretical Computer Science, 2014, 534: 2-23.

DOI：10.1016/j.tcs.2014.02.033

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

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.

• 出版日期2014-5-15