User loginNavigation |
Non-Deterministic Interaction Nets
Non-Deterministic Interaction Nets
AbstractThe Interaction Nets (IN) of Lafont are a graphical formalism used to model parallel computation. Their genesis can be traced back to the Proof Nets of Linear Logic. They enjoy several nice theoretical properties, amongst them pure locality of interaction, strong confluence, computational completeness, syntactically-definable deadlock-free fragments, combinatorial completeness (existence of a Universal IN). They also have nice "pragmatic" properties: they are simple and elegant, intuitive, can capture aspects of computation at widely varying levels of abstraction. Compared to term and graph rewriting systems, INs are much simpler (a subset of such systems that imposes several constraints on the rewriting process), but are still computationally complete (can capture the lambda-calculus). INs are a refinement of graph rewriting which keeps only the essential features in the system. Conventional INs are strongly confluent, and are therefore unsuitable for the modeling of non-deterministic systems such as process calculi and concurrent object-oriented programming. We study four diffrent ways of "breaking" the confluence of INs by introducing various extensions:
By Andris Birkmanis at 2005-01-06 08:33 | LtU Forum | previous forum topic | next forum topic | other blogs | 5765 reads
|
Browse archivesActive forum topics |
Recent comments
7 weeks 3 days ago
7 weeks 4 days ago
7 weeks 6 days ago
14 weeks 6 days ago
20 weeks 4 days ago
20 weeks 5 days ago
21 weeks 4 days ago
24 weeks 2 days ago
25 weeks 5 days ago
25 weeks 5 days ago