Results 1  10
of
52,346
Behavioral Equivalence in the Polymorphic PiCalculus
 JOURNAL OF THE ACM
, 1997
"... We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manip ..."
Abstract

Cited by 63 (8 self)
 Add to MetaCart
We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly
Conformance and Refinement of Behavior in picalculus
"... Process algebras are widely accepted for the specification of software systems. In particular, calculus addresses the description of dynamic systems, and permits their analysis for bisimilarity and other interesting properties. Though bisimilarity determines the equivalence of behavior, more fl ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Process algebras are widely accepted for the specification of software systems. In particular, calculus addresses the description of dynamic systems, and permits their analysis for bisimilarity and other interesting properties. Though bisimilarity determines the equivalence of behavior, more
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
Regional Analysis and a $\pi$Calculus With Groups
, 2000
"... this article that directly depends on the locality restriction imposed on the calculus. ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
this article that directly depends on the locality restriction imposed on the calculus.
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
. The multiaction $\pi$calculus can describe concurrent behavior of agents. Strong bisimilarity defined in the multiaction $\pi$ calculus is closed under inputprefixings and parallel compositions. 1
Final Semantics for the picalculus
, 1998
"... In this paper we discuss final semantics for the calculus, a process algebra which models systems that can dynamically change the topology of the channels. We show that the final semantics paradigm, originated by Aczel and Rutten for CCSlike languages, can be successfully applied also here. This i ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper we discuss final semantics for the calculus, a process algebra which models systems that can dynamically change the topology of the channels. We show that the final semantics paradigm, originated by Aczel and Rutten for CCSlike languages, can be successfully applied also here
Linearity and Persistence in the PiCalculus
"... Abstract Processes can be seen as resources; if they can be consumed, we say that they are linear, else we say that they are persistent. In this paper we present a study of linear and persistent processes wrt to the kind of system they can model. We choose πcalculus, perhaps the main representative ..."
Abstract
 Add to MetaCart
Abstract Processes can be seen as resources; if they can be consumed, we say that they are linear, else we say that they are persistent. In this paper we present a study of linear and persistent processes wrt to the kind of system they can model. We choose πcalculus, perhaps the main
Spatial and behavioral types in the picalculus ⋆
"... Abstract. We present a framework that combines ideas from spatial logics and Igarashi and Kobayashi’s behavioural type systems, drawing benefits from both. In our approach, type systems for the picalculus are introduced where newly declared (restricted) names are annotated with spatial process prop ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We present a framework that combines ideas from spatial logics and Igarashi and Kobayashi’s behavioural type systems, drawing benefits from both. In our approach, type systems for the picalculus are introduced where newly declared (restricted) names are annotated with spatial process
Contextual Equivalence for the PiCalculus that can Stop
, 2014
"... Abstract. The picalculus is a wellanalyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higherorder concurrent and/or functional programming languages use a contextual semantics observing the termination behavior of ..."
Abstract
 Add to MetaCart
Abstract. The picalculus is a wellanalyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higherorder concurrent and/or functional programming languages use a contextual semantics observing the termination behavior
Nominal picalculus and nominal automata
"... Abstract. In this paper we introduce a nominal picalculus and examine its operational behavior under earlytransition relation. Our calculus is a reformulation of the piθcalculus, i.e. the picalculus of nameabstracted processes, in the theory of nominal sets of Gabbay and Pitts. The mechanics o ..."
Abstract
 Add to MetaCart
Abstract. In this paper we introduce a nominal picalculus and examine its operational behavior under earlytransition relation. Our calculus is a reformulation of the piθcalculus, i.e. the picalculus of nameabstracted processes, in the theory of nominal sets of Gabbay and Pitts. The me
Results 1  10
of
52,346