A characterization of regular expressions under bisimulation
From MaRDI portal
Publication:3546331
DOI10.1145/1219092.1219094zbMATH Open1292.68102OpenAlexW2117716713MaRDI QIDQ3546331FDOQ3546331
Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1219092.1219094
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Contract-based discovery of Web services modulo simple orchestrators
- Regular binoid expressions and regular binoid languages.
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions
- Revisiting sequential composition in process calculi
- Title not available (Why is that?)
- Title not available (Why is that?)
- Better automata through process algebra
- Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
- On star expressions and completeness theorems
- An Equational Axiomatization of Bisimulation over Regular Expressions
This page was built for publication: A characterization of regular expressions under bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546331)
