Search

• < Previous
• 1
• Next >

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity

Milner (1984) defined an operational semantics for regular expressions as finite-state processes. In order to axiomatize bisimilarity of regular expressions under this process semantics, he adapted Salomaa's proof system that is complete for equality of regular expressions under the language&nbsp;[&hellip;]