Results 1  10
of
61,362
The picalculus
, 2013
"... We formalise the picalculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely followi ..."
Abstract
 Add to MetaCart
We formalise the picalculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely
Expressiveness of the piCalculus and the $Calculus
"... Abstract: In this paper we investigate the expressiveness of two process algebras, the picalculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation. In ..."
Abstract
 Add to MetaCart
Abstract: In this paper we investigate the expressiveness of two process algebras, the picalculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation
The PiCalculus
, 2005
"... From the title, you might expect that this was a book for managers who wanted to create diagrams of business processes. In fact, its essentially about a number of technical issues related to Business Process Management Systems. Moreover, it is primarily for software developers who want to think abou ..."
Abstract
 Add to MetaCart
From the title, you might expect that this was a book for managers who wanted to create diagrams of business processes. In fact, its essentially about a number of technical issues related to Business Process Management Systems. Moreover, it is primarily for software developers who want to think about modeling rather than for practitioners who want advice on how to actually model. Here's the table of contents, with two chapters broken into subsections to give you a flavor of the scope of the book:
Applied pi calculus
, 2011
"... The applied pi calculus is a language for modelling security protocols. It is an extension of the pi calculus, a language for studying concurrency and process interaction. This chapter presents the applied pi calculus in a tutorial style. It describes reachability, correspondence, and observational ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
The applied pi calculus is a language for modelling security protocols. It is an extension of the pi calculus, a language for studying concurrency and process interaction. This chapter presents the applied pi calculus in a tutorial style. It describes reachability, correspondence, and observational
Multiaction $\pi$calculus
"... We propose a new trulyconcurrent semantics for the $\pi \mathrm{c}\mathrm{a}\mathrm{l}\mathrm{C}\mathrm{u}\mathrm{l}\mathrm{u}\mathrm{s}[1] $. We extend the labelled transition system of the $\pi$calculus to use multisets of actions as labels. We call this extension multiaction $\pi$calculus. ..."
Abstract
 Add to MetaCart
We propose a new trulyconcurrent semantics for the $\pi \mathrm{c}\mathrm{a}\mathrm{l}\mathrm{C}\mathrm{u}\mathrm{l}\mathrm{u}\mathrm{s}[1] $. We extend the labelled transition system of the $\pi$calculus to use multisets of actions as labels. We call this extension multiaction $\pi$calculus
Presheaf Models for the piCalculus
, 1997
"... Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the p ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
is the picalculus, a calculus for `mobile processes' whose communication topology varies as channels are created and discarded. A denotational semantics is described for the picalculus within an indexed category of profunctors; the model is fully abstract for bisimilarity, in the sense
WSCDL and PiCalculus
"... Abstract. With the publishing and creation of the Web Services Description Language (WSCDL) and the success of the Pi Calculus it has been stated that the former is based on the latter. A well reasoned answer for or against this claim is not to be found. Here an approach to a well reasoned answer i ..."
Abstract
 Add to MetaCart
Abstract. With the publishing and creation of the Web Services Description Language (WSCDL) and the success of the Pi Calculus it has been stated that the former is based on the latter. A well reasoned answer for or against this claim is not to be found. Here an approach to a well reasoned answer
for the Applied Pi Calculus ∗
"... We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs fro ..."
Abstract
 Add to MetaCart
We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs
\PiCalculus with Type Similarity
, 1995
"... Motivated by the problems of the undecidablity of higherorder unification and hence the undecidability of \Piunification, Pym and Elliott give a weaker notion of typing for \Piobjects : type similarity. In this paper we present a new calculus giving a formal theory of type similarity that capture ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Motivated by the problems of the undecidablity of higherorder unification and hence the undecidability of \Piunification, Pym and Elliott give a weaker notion of typing for \Piobjects : type similarity. In this paper we present a new calculus giving a formal theory of type similarity
Results 1  10
of
61,362