A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity

04/27/2020
by   Clemens Grabmayer, et al.
0

Robin Milner (1984) gave a sound proof system for bisimilarity of regular expressions interpreted as processes: Basic Process Algebra with unary Kleene star iteration, deadlock 0, successful termination 1, and a fixed-point rule. He asked whether this system is complete. Despite intensive research over the last 35 years, the problem is still open. This paper gives a partial positive answer to Milner's problem. We prove that the adaptation of Milner's system over the subclass of regular expressions that arises by dropping the constant 1, and by changing to binary Kleene star iteration is complete. The crucial tool we use is a graph structure property that guarantees expressibility of a process graph by a regular expression, and is preserved by going over from a process graph to its bisimulation collapse.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/30/2021

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

By adapting Salomaa's complete proof system for equality of regular expr...
09/17/2021

Games for Succinctness of Regular Expressions

We present a version of so called formula size games for regular express...
06/15/2021

On Star Expressions and Coalgebraic Completeness Theorems

An open problem posed by Milner asks for a proof that a certain axiomati...
11/22/2021

A Complete Axiom System for 1-Free Kleene Star Expressions under Bisimilarity: An Elementary Proof

Grabmayer and Fokkink recently presented a finite and complete axiomatiz...
02/14/2022

Processes Parametrised by an Algebraic Theory

We develop a (co)algebraic framework to study a family of process calcul...
03/17/2022

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

Milner (1984) defined an operational semantics for regular expressions a...
07/03/2020

A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons

We give a complete description of all convex polyhedra whose surface can...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.