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

DOI10.46298/lmcs-19(2:17)2023arXiv2203.09501MaRDI QIDQ6135767

Clemens Grabmayer

Publication date: 26 August 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.09501

zbMATH Keywords

regular expressionscoinductionbisimilarityprocess theoryproof transformationsderivable and admissible inference rulesinterpretational proof theory

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (2)

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity ⋮ Better automata through process algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• A complete inference system for a class of regular behaviours
• Actions speak louder than words: proving bisimilarity for context-free processes
• Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
• A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity
• Regular expression containment
• Algebra and Coalgebra in Computer Science
• Two Complete Axiom Systems for the Algebra of Regular Events
• Depth-First Search and Linear Graph Algorithms
• A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity

This page was built for publication: A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity