Minimality and separation results on asynchronous mobile processes - representability theorems by concurrent combinators

Author： Yoshida N.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.274, Iss.1, 2002-03, pp. : 231-276

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

Distributed Monitoring of Concurrent and Asynchronous Systems*

By Fabre Eric Benveniste Albert Haar Stefan Jard Claude

Discrete Event Dynamic Systems, Vol. 15, Iss. 1, 2005-03 ,pp. : 33-84

Springer Publishing Company

Access to resources Recommend Favorite

CONCURRENT, ASYNCHRONOUS SEARCH FOR THE AVAILABILITY OF KNOWLEDGE

By Fabiano Antonio S. Cerri Stefano A.

Applied Artificial Intelligence, Vol. 10, Iss. 2, 1996-04 ,pp. : 145-162

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Asynchronous Communication Model for Distributed Concurrent Objects

By Johnsen Einar Owe Olaf

Software and Systems Modeling (SoSyM), Vol. 6, Iss. 1, 2007-03 ,pp. : 39-58

Springer Publishing Company

Access to resources Recommend Favorite

Computable concurrent processes

By Moschovakis Y.N.

Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. : 243-273

Elsevier

Access to resources Recommend Favorite

Acceptability of an asynchronous learning forum on mobile devices

By Chang Chih-Kai

Behaviour and Information Technology, Vol. 29, Iss. 1, 2010-01 ,pp. : 23-33

Taylor & Francis Ltd

Access to resources Recommend Favorite