scientific article; zbMATH DE number 7315073

zbMATH Open1455.68083MaRDI QIDQ4963995FDOQ4963995

Authors: Bas Luttik, Tim M. Müller, Paul van Tilburg, Jos C. M. Baeten 

Publication date: 24 February 2021

Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESS10.1

Title of this publication is not available (Why is that?)

Recommendations

• Expressiveness modulo bisimilarity of regular expressions with parallel composition
• A characterization of regular expressions under bisimulation
• An Equational Axiomatization of Bisimulation over Regular Expressions
• A Decision Procedure for Bisimilarity of Generalized Regular Expressions
• A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
• scientific article; zbMATH DE number 7774242
• A complete proof system for 1-free regular expressions modulo bisimilarity
• A Compact Proof of Decidability for Regular Expression Equivalence
• Extended regular expressions: succinctness and decidability
• Extended Regular Expressions: Succinctness and Decidability

Mathematics Subject Classification ID

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

Cited In (6)

• A characterization of regular expressions under bisimulation
• Towards a formal representation of interactive systems
• Back to the format: a survey on SOS for probabilistic processes
• Expressiveness modulo bisimilarity of regular expressions with parallel composition
• A Decision Procedure for Bisimilarity of Generalized Regular Expressions
• Semi-linear Parikh Images of Regular Expressions via Reduction

This page was built for publication:

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