Algebraic characterizations of trace and decorated trace equivalences over tree-like structures

DOI10.1016/S0304-3975(99)00300-XzbMath0974.68093OpenAlexW1982912460MaRDI QIDQ5940926

X. Jun Chen, R. D. Nicola

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00300-x

zbMATH Keywords

abstraction homomorphismsbehavioural equivalencesminimal representativessynchronization trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Specification-oriented semantics for communicating processes
• Bisimulations and abstraction homomorphisms
• Extensional equivalences for transition systems
• A distributed operational semantics of CCS based on condition/event systems
• A calculus of total correctness for communicating processes
• Testing equivalences for processes
• An algebraic characterization of observational equivalence
• An algebraic characterization of transition system equivalences
• The power of the future perfect in program logics
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• A Theory of Communicating Sequential Processes
• Acceptance trees
• Three logics for branching bisimulation