On the decidability of process equivalences for the -calculus

Author： Dam M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.183, Iss.2, 1997-09, pp. : 215-228

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the decidability of fragments of the asynchronous -calculus

By Amadio R.M.   Meyssonnier C.  

Electronic Notes in Theoretical Computer Science, Vol. 52, Iss. 1, 2004-01 ,pp. : 1-17

Elsevier

Access to resources Recommend Favorite

A Generalized Deadlock-Free Process Calculus

By Sumii E.   Kobayashi N.  

Electronic Notes in Theoretical Computer Science, Vol. 16, Iss. 3, 2004-01 ,pp. : 1-23

Elsevier

Access to resources Recommend Favorite

Process calculus based upon evaluation to committed form

By Pitts A.M.   Ross J.R.X.  

Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. : 155-182

Elsevier

Access to resources Recommend Favorite

A Process-Calculus Analysis of Concurrent Operations on B-Trees

By Philippou A.   Walker D.  

Journal of Computer and System Sciences, Vol. 62, Iss. 1, 2001-02 ,pp. : 73-122

Academic Press

Access to resources Recommend Favorite

A process-calculus-based abstraction for coordinating multi-agent groups

By Mukherji M.   Kafura D.  

Theoretical Computer Science, Vol. 192, Iss. 2, 1998-02 ,pp. : 287-314

Elsevier

Access to resources Recommend Favorite