An Equational Axiomatization of Bisimulation over Regular Expressions

DOI10.1093/logcom/12.2.301zbMath1012.68143OpenAlexW2050354577MaRDI QIDQ4542240

Rocco De Nicola, Anna Labella, Flavio Corradini

Publication date: 16 June 2003

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/12.2.301

zbMATH Keywords

regular expressionsbisimulationprocess algebrasequational axiomatization

Mathematics Subject Classification ID

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

Related Items (4)

Unnamed Item ⋮ Iteration Semirings ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?

This page was built for publication: An Equational Axiomatization of Bisimulation over Regular Expressions