Concurrent Kleene Algebra: Free Model and Completeness-Reference-Cited by-同舟云学术

Concurrent Kleene Algebra: Free Model and Completeness

Published:2018 Issue: Volume: Page:856-882
ISSN:0302-9743
Container-title:Programming Languages and Systems
language:
Short-container-title:

Author:

Kappé Tobias,Brunet Paul,Silva Alexandra,Zanasi Fabio

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-89884-1_30

Reference23 articles.

1. Backhouse, R.: Closure algorithms and the star-height problem of regular languages. Ph.D. thesis, University of London (1975)

2. Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Proceedings of the Principles of Programming Languages (POPL), pp. 457–468 (2013)

3. Brunet, P., Pous, D., Struth, G.: On decidability of concurrent Kleene algebra. In: Proceedings of the Concurrency Theory (CONCUR), pp. 28:1–28:15 (2017)

4. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall Ltd., London (1971)

5. Foster, N., Kozen, D., Milano, M., Silva, A., Thompson, L.: A coalgebraic decision procedure for NetKAT. In: Proceedings of the Principles of Programming Languages (POPL), pp. 343–355 (2015)

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

1. Kleene Theorems for Lasso Languages and $$\omega $$-Languages;Lecture Notes in Computer Science;2024

2. Towards an Algebra for Unifying Theories of Concurrent Programming (UTCP);Lecture Notes in Computer Science;2024

3. Presenting Interval Pomsets with Interfaces;Lecture Notes in Computer Science;2024

4. A Finite Axiomatisation of Finite-State Automata Using String Diagrams;Logical Methods in Computer Science;2023-02-15

5. Deconstructing the Calculus of Relations with Tape Diagrams;Proceedings of the ACM on Programming Languages;2023-01-09