JC-Nets

Authors:
Gabriel Ciobanu;Mihai Rotaru
Affiliations:
-;-
Venue:
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Year:
2001

Citing 5
Cited 0

The reflexive CHAM and the join-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Pi-Nets: A Graphical Form of pi-Calculus

ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Some Results in the Joint-Calculus

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Control Structures

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce and study a graphical representation of the join calculus given by the so called jc-nets. jc-nets provide a fully abstract semantics for a Turing complete fragment of the join calculus. Th us a new formal model for concurrency and distributed systems is introduced.This new formal model simplifies Milner's π-nets, while preserving their expressive power.