B. A.S. Luttik
Expressiveness modulo bisimilarity of regular expressions with parallel composition
Luttik, B. A.S.; Baeten, Jos C.M.; Muller, T. I.M.; Van Tilburg, Paul
Abstract
© Cambridge University Press 2015. The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness modulo bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style parallel composition gives a further increase in expressiveness, still insufficient, however, to facilitate the expression of all finite automata up to bisimilarity. Finally, we prove that the theory of regular expressions with ACP-style parallel composition and encapsulation is expressive enough to express all finite automata up to bisimilarity. Our results extend the expressiveness results obtained by Bergstra, Bethke and Ponse for process algebras with (the binary variant of) Kleene's star operation.
Journal Article Type | Conference Paper |
---|---|
Acceptance Date | Aug 1, 2014 |
Online Publication Date | Jan 2, 2015 |
Publication Date | Jan 2, 2015 |
Deposit Date | Jan 13, 2020 |
Journal | Mathematical Structures in Computer Science |
Print ISSN | 0960-1295 |
Electronic ISSN | 1469-8072 |
Publisher | Cambridge University Press (CUP) |
Peer Reviewed | Peer Reviewed |
Volume | 26 |
Issue | 6 |
Pages | 933-968 |
DOI | https://doi.org/10.1017/S0960129514000309 |
Keywords | Mathematics (miscellaneous); Computer Science Applications |
Public URL | https://nottingham-repository.worktribe.com/output/2140768 |
You might also like
The Reputation Lag Attack
(2019)
Conference Proceeding
Information Theoretical Analysis of Unfair Rating Attacks under Subjectivity
(2019)
Journal Article
Is It Harmful when Advisors Only Pretend to Be Honest?
(2016)
Conference Proceeding
Using Information Theory to Improve the Robustness of Trust Systems
(2015)
Conference Proceeding
The Fallacy of Endogenous Discounting of Trust Recommendations
(2015)
Conference Proceeding
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search