Author： Amadio R.M. Meyssonnier C.
Publisher： Elsevier
ISSN： 1571-0661
Source： Electronic Notes in Theoretical Computer Science, Vol.52, Iss.1, 2004-01, pp. : 1-17
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 process equivalences for the -calculus
By Dam M.
Theoretical Computer Science, Vol. 183, Iss. 2, 1997-09 ,pp. :
Access to resources
Recommend
On bisimulations for the asynchronous -calculus
By Amadio R.M. Castellani I. Sangiorgi D.
Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. :
On model checking for the -calculus and its fragments
By Emerson
Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. :
Decidability problems in grammar systems
By Mihalache V.
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
Frontier between decidability and undecidability: a survey
Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. :