Results 11 to 20 of about 10,135 (101)
Models and termination of proof reduction in the $\lambda$$\Pi$-calculus modulo theory
, 2017 We define a notion of model for the $\lambda$$\Pi$-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the $\lambda$$\Pi$-calculus modulo any super-consistent ...
Dowek, Gilles
core +1 more source
Observing Success in the Pi-Calculus [PDF]
, 2015 A contextual semantics - defined in terms of successful termination and may- and should-convergence - is analyzed in the synchronous pi-calculus with replication and a constant Stop to denote success.
Sabel, David
core +1 more source
Formalising the pi-calculus using nominal logic [PDF]
, 2008 We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL.
Bengtson +16 more
core +5 more sources
An Intuitive Automated Modelling Interface for Systems Biology
, 2009 We introduce a natural language interface for building stochastic pi calculus models of biological systems. In this language, complex constructs describing biochemical events are built from basic primitives of association, dissociation and transformation.
Emmanuelle Caron +4 more
core +4 more sources
A decompilation of the pi-calculus and its application to termination [PDF]
, 2011 We study the correspondence between a concurrent lambda-calculus in administrative, continuation passing style and a pi-calculus and we derive a termination result for the ...
Amadio, Roberto
core +3 more sources
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets [PDF]
, 2013 We develop a polynomial translation from finite control pi-calculus processes to safe low-level Petri nets. To our knowledge, this is the first such translation.
Hüchting, Reiner +2 more
core +1 more source
Context-Free Session Types for Applied Pi-Calculus [PDF]
, 2018 We present a binary session type system using context-free session types to a version of the applied pi-calculus of Abadi et. al. where only base terms, constants and channels can be sent.
Aagaard, Jens +3 more
core +2 more sources
Structural Rewriting in the pi-Calculus [PDF]
, 2014 We consider reduction in the synchronous pi-calculus with replication, without sums. Usual definitions of reduction in the pi-calculus use a closure w.r.t. structural congruence of processes.
Sabel, David
core +1 more source
The Buffered \pi-Calculus: A Model for Concurrent Languages
, 2012 Message-passing based concurrent languages are widely used in developing large distributed and coordination systems. This paper presents the buffered $\pi$-calculus --- a variant of the $\pi$-calculus where channel names are classified into buffered and ...
Deng, Xiaojie +3 more
core
Are there new models of computation? Reply to Wegner and Eberbach [PDF]
, 2007 Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called superTuring models such as interaction machines, the [pi]calculus and the ...
Adamyan +54 more
core +4 more sources