Results 1  10
of
152,474
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
A Denotational Semantics for the piCalculus
 Fifth Irish Workshop in Formal Methods (IWFM’01
, 2001
"... In his categorical framework, Stark defines a domaintheoretic model for the #calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize St ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In his categorical framework, Stark defines a domaintheoretic model for the #calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize
A Structural Approach to Operational Semantics
, 1981
"... Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be ..."
Abstract

Cited by 1541 (3 self)
 Add to MetaCart
Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be taken as given: Truthvalues This is the set T = ftt; ffg and is ranged over by (the metavariable) t (and we also happily employ for this (and any other) metavariable sub and superscripts to generate other metavariables: t ; t 0 ; t 1k ).
An Analysis of picalculus Bisimulations
, 1995
"... The ßcalculus is a relatively simple framework in which the semantics of the dynamic creation and transmission of channels can be studied. We consider in particular the issue of defining and verifying the equivalence of ßterms in the context of bisimulation based semantics. We distinguish three ma ..."
Abstract
 Add to MetaCart
The ßcalculus is a relatively simple framework in which the semantics of the dynamic creation and transmission of channels can be studied. We consider in particular the issue of defining and verifying the equivalence of ßterms in the context of bisimulation based semantics. We distinguish three
The STATEMATE Semantics of Statecharts
, 1996
"... This article describes the semantics of the language of statecharts as implenented in the STATEMATE system [Harel et al. 1990; Harel and Politi 1996]. The initial version of this semantics was developed by a team about.10 years ago. With the added experience of the users of the system it has since b ..."
Abstract

Cited by 651 (12 self)
 Add to MetaCart
This article describes the semantics of the language of statecharts as implenented in the STATEMATE system [Harel et al. 1990; Harel and Politi 1996]. The initial version of this semantics was developed by a team about.10 years ago. With the added experience of the users of the system it has since
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
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
Proof Systems for piCalculus Logics
, 2001
"... In this paper we study the problem of verifying general temporal and functional properties of mobile and dynamic process networks, cast in terms of the picalculus. Much of the expressive power of this calculus derives from the combination of name generation and communication (to handle mobility ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
compositional proof system is given with the scope of verifying dynamic networks of picalculus agents against properties specified in this logic. The proof system consists of a local part based, roughly, on the classical sequent calculus extended with data structures for private names, and rules to support
Results 1  10
of
152,474