Honda, K. and Yoshida, N., Nameless Concurrent Combinators, under preparation, December 1994, to appear as a Keio-CS-report. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Graph Notation For Concurrent Combinators - Yoshida (1995) (17 citations) Self-citation (Yoshida) (Correct)
....Section 5 presents the construction of behavioural equalities over process graphs with examples and studies their elementary properties. Section 6 summarises other results on process graphs and discusses related work and further issues. 2. Process Graphs (1) Basic Definition Process graphs (cf. [12]) are nameless representation of processes, using the notion of graphs and their composition. Any graph is composed from a finite number of atomic agents and their connection. The results in [9, 10] already showed that the full expressive power of interacting processes can be obtained using a ....
Honda, K. and Yoshida, N., Nameless Concurrent Combinators, under preparation, December 1994, to appear as a Keio-CS-report.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC