Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete-Reference-Cited by-同舟云学术

Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Grabmayer Clemens Armin¹

Affiliation:

1. Department of Computer Science, Gran Sasso Science Institute, Italy

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3531130.3532430

Reference14 articles.

1. A characterization of regular expressions under bisimulation

2. Regular Expressions in Process Algebra

3. An Equational Axiomatization of Bisimulation over Regular Expressions

4. Wan Fokkink . 1997. Axiomatizations for the Perpetual Loop in Process Algebra . In Proc. ICALP’97(LNCS, Vol. 1256) . Springer , Berlin, Heidelberg , 571–581. https://doi.org/10.1007/3-540-63165-8_212 10.1007/3-540-63165-8_212 Wan Fokkink. 1997. Axiomatizations for the Perpetual Loop in Process Algebra. In Proc. ICALP’97(LNCS, Vol. 1256). Springer, Berlin, Heidelberg, 571–581. https://doi.org/10.1007/3-540-63165-8_212

5. Basic Process Algebra with Iteration: Completeness of its Equational Axioms

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Completeness Theorem for Probabilistic Regular Expressions;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests;Programming Languages and Systems;2023

3. Better Automata Through Process Algebra;Lecture Notes in Computer Science;2022