Concurrent processes as wireless proof nets
نویسندگان
چکیده
We present a proofs-as-programs correspondence between linear logic and process calculi that permits non-deterministic behaviours. Processes are translated into wireless proof nets, i.e. proof nets of multiplicative linear logic without cut wires. Typing a term using them consists in typing some of its possible determinisations in standard sequent calculus. Generalized cut-elimination steps in wireless proof nets is shown to correspond to executions that avoid deadlocks.
منابع مشابه
Concurrent programming as proof net construction
We propose a concurrent process calculus, called Calcul Parall ele Logique (CPL), based on the paradigm of computation as proof net construction in linear logic. CPL uses a fragment of rst order intuitionistic linear logic where formulas represent processes and proof nets successful computations. In these computations, communication is expressed in an asynchronous way by means of axiom links. W...
متن کاملYet Another Correctness Criterion for Multiplicative Linear Logic with MIX
A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical ow of information inside a proof, that is, roughly, a distribut...
متن کاملA Proof Theoretical Approach to Communication
The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. The algebraic properties of the model are studied. Its relationship to sequential computation is illustrated by showing that it incorporates the operational semantics of the call-by-name lambda calculus. Practically the model has pi calculus as a submodel....
متن کاملFormal Reasoning about Actor Programs Using Temporal Logic
We here present an approach to reasoning about actor programs on the basis of temporal logic. Temporal logic is particularly appropriate for the speciication of concurrent programs, but most known temporal logic proof systems for concurrent computations rely on imperative language constructs, ignoring, e.g., the creation of processes and the dynamic connguration of communication channels, which...
متن کاملProving liveness properties of concurrent programs using petri-nets
With the increased scale of distributed computations the complexity of liveness proofs have increased. In this paper we endeavor to simplify the process of verifying a concurrent system using well know modeling techniques. The choice of modeling tool as well as the proof is based on future scalability and automation. We translate the formal proof to a petri-net representation and use this to ve...
متن کامل