56 research outputs found
The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens (Long Version)
We introduce a geometry of interaction model for Mazza's multiport
interaction combinators, a graph-theoretic formalism which is able to
faithfully capture concurrent computation as embodied by process algebras like
the -calculus. The introduced model is based on token machines in which
not one but multiple tokens are allowed to traverse the underlying net at the
same time. We prove soundness and adequacy of the introduced model. The former
is proved as a simulation result between the token machines one obtains along
any reduction sequence. The latter is obtained by a fine analysis of
convergence, both in nets and in token machines
Acyclic Solos and Differential Interaction Nets
We present a restriction of the solos calculus which is stable under
reduction and expressive enough to contain an encoding of the pi-calculus. As a
consequence, it is shown that equalizing names that are already equal is not
required by the encoding of the pi-calculus. In particular, the induced solo
diagrams bear an acyclicity property that induces a faithful encoding into
differential interaction nets. This gives a (new) proof that differential
interaction nets are expressive enough to contain an encoding of the
pi-calculus. All this is worked out in the case of finitary (replication free)
systems without sum, match nor mismatch
Interaction Automata and the ia2d Interpreter
We introduce interaction automata as a topological model of
computation and present the conceptual plane interpreter ia2d.
Interaction automata form a refinement of both interaction nets and
cellular automata models that combine data deployment, memory
management and structured computation mechanisms. Their local
structure is inspired from pointer machines and allows an asynchronous
spatial distribution of the computation. Our tool can be considered
as a proof-of-concept piece of abstract hardware on which functional
programs can be run in parallel
Correctness of services and their composition
We study correctness of services and their composition and investigate how the design of correct service compositions can be systematically supported. We thereby focus on the communication protocol of the service and approach these questions using formal methods and make contributions to three scenarios of SOC.Wir studieren die Korrektheit von Services und Servicekompositionen und untersuchen, wie der Entwurf von korrekten Servicekompositionen systematisch unterstĂĽtzt werden kann. Wir legen dabei den Fokus auf das Kommunikationsprotokoll der Services. Mithilfe von formalen Methoden tragen wir zu drei Szenarien von SOC bei
A multiprocessor system using a switch matrix configuration
This thesis describes a class of interconnection networks based on the use of a switch matrix to provide processor to memory communication. This switch allows a direct link between any processor to any memory module. The cost and performance of this network are analytically examined. The results are compared with those of a multiprocessor system using a time-shared bus configuration and it is shown that for the two extreme cases of maximum and minimum throughput, the two approaches are equivalent from a performance point of view. However, in the general case, even with a higher cost, the switch matrix provides a much better performance than the time-shared bus configuration. Furthermore, the architecture of a multiprocessor MIMD type computer using a switch matrix is investigated and Petri net techniques are used to model process coordination among processors --Abstract, page ii
Correctness of services and their composition
We study correctness of services and their composition and investigate how the design of correct service compositions can be systematically supported. We thereby focus on the communication protocol of the service and approach these questions using formal methods and make contributions to three scenarios of SOC.Wir studieren die Korrektheit von Services und Servicekompositionen und untersuchen, wie der Entwurf von korrekten Servicekompositionen systematisch unterstĂĽtzt werden kann. Wir legen dabei den Fokus auf das Kommunikationsprotokoll der Services. Mithilfe von formalen Methoden tragen wir zu drei Szenarien von SOC bei
On Context Semantics and Interaction Nets
International audienceContext semantics is a tool inspired by Girard' s geometry of interaction. It has had many applications from study of optimal reduction to proofs of complexity bounds. Yet, context semantics have been defined only on -calculus and linear logic. In order to study other languages, in particular languages with more primitives (built-in arithmetic, pattern matching,...) we define a context semantics for a broader framework: interaction nets. These are a well-behaved class of graph rewriting systems. Here, two applications are explored. First, we define a notion of weight, based on context semantics paths, which bounds the length of reduction of nets. Then, we define a denotational semantics for a large class of interaction net systems
Dataflow computers: a tutorial and survey
Journal ArticleThe demand for very high performance computer has encouraged some researchers in the computer science field to consider alternatives to the conventional notions of program and computer organization. The dataflow computer is one attempt to form a new collection of consistent systems ideas to improve both computer performance and to alleviate the software design problems induced by the construction of highly concurrent programs
- …