An Equational Axiomatization of Bisimulation over Regular Expressions

DOI10.1093/LOGCOM/12.2.301MaRDI QIDQ4542240zbMATH OpenOpenAlexFDO

Authors Rocco De Nicola, Flavio Corradini, Anna Labella

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

bisimulationequational axiomatizationprocess algebrasregular expressions

Mathematics Subject Classification ID

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

Recommendations

• A Finite Axiomatization of Nondeterministic Regular Expressions
• A characterization of regular expressions under bisimulation
• A complete proof system for 1-free regular expressions modulo bisimilarity
• Equational axioms for regular sets
• On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based

Cited in

(14)

• Models of nondeterministic regular expressions
• Proof Pearl: regular expression equivalence and relation algebra
• Axiomatizing weighted synchronization trees and weighted bisimilarity
• Expressiveness modulo bisimilarity of regular expressions with parallel composition
• A Decision Procedure for Bisimilarity of Generalized Regular Expressions
• Iteration Semirings
• A characterization of regular expressions under bisimulation
• A Finite Axiomatization of Nondeterministic Regular Expressions
• scientific article; zbMATH DE number 7315073 (Why is no real title available?)
• Modeling terms by graphs with structure constraints (two illustrations)
• A complete proof system for 1-free regular expressions modulo bisimilarity
• Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
• From compactifying lambda-letrec terms to recognizing regular-expression processes (extended abstract and literature)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542240)