On the expressiveness and decidability of higher-order process calculi-Reference-Cited by-同舟云学术

On the expressiveness and decidability of higher-order process calculi

Published:2011-02 Issue:2 Volume:209 Page:198-226
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Lanese Ivan,Pérez Jorge A.,Sangiorgi Davide,Schmitt Alan

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference50 articles.

1. A calculus of higher order communicating systems;Thomsen,1989

2. Plain CHOCS: a second generation calculus for higher order processes;Thomsen;Acta Inform.,1993

3. D. Sangiorgi, Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms, Ph.D. thesis CST-99-93, University of Edinburgh, Department of Computer Science, 1992.

4. B. Thomsen, Calculi for Higher Order Communicating Systems, Ph.D. thesis, Imperial College, 1990.

5. X. Xu, On the Bisimulation Theory and Axiomatization of Higher-order Process Calculi, Ph.D. thesis, Shanghai Jiao Tong University, 2007.

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

1. Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines;Logical Methods in Computer Science;2024-07-03

2. Categorical specification and implementation of Replicated Data Types;Theoretical Computer Science;2022-02

3. On Probabilistic Extension of the Interaction Theory;Formal Methods and Software Engineering;2022

4. On Decidability of the Bisimilarity on Higher-order Processes with Parameterization;Electronic Proceedings in Theoretical Computer Science;2021-08-23

5. On the Interactive Power of Higher-order Processes Extended with Parameterization;Formal Aspects of Computing;2021-03