Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations.

DOI10.4230/LIPICS.CONCUR.2020.35OpenAlexW3081625212MaRDI QIDQ5089302

Tingting Yu, Xin Xin Liu

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2020.35

zbMATH Keywords

bisimulationcongruenceaxiomatisationsoundness and completeness

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Reactive bisimulation semantics for a process algebra with timeouts ⋮ Unnamed Item

Cites Work

• Bisimulation and divergence
• A complete inference system for a class of regular behaviours
• A complete axiomatisation for observational congruence of finite-state behaviours
• Axiomatizing prefix iteration with silent steps
• Axiomatising divergence
• Algebraic laws for nondeterminism and concurrency
• Branching time and abstraction in bisimulation semantics
• Unnamed Item

This page was built for publication: Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations.