A complete inference system for a class of regular behaviours-Reference-Cited by-同舟云学术

A complete inference system for a class of regular behaviours

Author:

Milner Robin

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference10 articles.

1. Denotational semantics of concurrency;de Bakker,1982

2. Fundamental Properties of Infinite Trees;Courcelle;Report No. 8105, Uer de Mathématique et Informatique Bordeaux,1981

3. Monadic computation and iterative algebraic theories;Elgot,1973

4. On observing nondeterminism and concurrency;Hennessy;Lecture Notes in Computer Science,1973

5. A Theory of Communicating Sequential Processes;Hoare,1981

Cited by 212 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 proof theory of right-linear (ω-)grammars via cyclic proofs;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

3. A dynamic logic with branching modalities;Journal of Logical and Algebraic Methods in Programming;2024-01