Author: Mullins J.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.174, Iss.1, 1997-03, pp. : 231-246
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Probabilistic communicating processes
By Seidel K.
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :
Verifying identical communicating processes is undecidable
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
Automata and processes on multisets of communicating objects
By Yang Linmin
Natural Computing, Vol. 9, Iss. 4, 2010-12 ,pp. :
The algebra of communicating processes with empty process
Theoretical Computer Science, Vol. 177, Iss. 2, 1997-05 ,pp. :