Author： Brookes S. Older S.
Publisher： Elsevier
ISSN： 1571-0661
Source： Electronic Notes in Theoretical Computer Science, Vol.1, Iss.1, 2004-01, pp. : 1-20
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
Full abstraction for strongly fair communicating processes
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :
Access to resources
Recommend
Full abstraction and recursion
Theoretical Computer Science, Vol. 151, Iss. 1, 1995-11 ,pp. :
Probabilistic communicating processes
By Seidel K.
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :
Full abstraction for Idealized Algol with passive expressions
Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. :
Verifying identical communicating processes is undecidable
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :