Results 1  10
of
469
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
. The calculus is an extension of the process algebra CCS, following work by Engberg and Nielsen, who added mobility to CCS while preserving its algebraic properties. The rrcalculus gains simplicity by removing all distinction between variables and constants; communication links are identified by names
A Calculus of Mobile Agents
, 1996
"... . We introduce a calculus for mobile agents and give its chemical semantics, with a precise definition for migration, failure, and failure detection. Various examples written in our calculus illustrate how to express remote executions, dynamic loading of remote resources and protocols with mobile ag ..."
Abstract

Cited by 281 (13 self)
 Add to MetaCart
agents. We give the encoding of our distributed calculus into the joincalculus. 1 Introduction It is not easy to match concurrency and distribution. Suppose, for instance, that we want to implement a concurrent calculus with CCSlike communication channels and with processes running on different
A Comparative Introduction to CSP, CCS and LOTOS
, 1994
"... The language features and formal definitions of the three most popular process algebras, csp, ccs and lotos, are introduced and compared. Categories and Subject Descriptors: D.2.1 [Software Engineering]: Requirements/Specificationslanguages, methodologies; F.4.3 [Mathemati cal Logic and Form ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The language features and formal definitions of the three most popular process algebras, csp, ccs and lotos, are introduced and compared. Categories and Subject Descriptors: D.2.1 [Software Engineering]: Requirements/Specificationslanguages, methodologies; F.4.3 [Mathemati cal Logic
A Calculus of Mobile Processes, Part I
 I AND II. INFORMATION AND COMPUTATION
, 1989
"... We present the ßcalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 219 (4 self)
 Add to MetaCart
. The calculus is an extension of the process algebra CCS, following work by Engberg and Nielsen who added mobility to CCS while preserving its algebraic properties. The ßcalculus gains simplicity by removing all distinction between variables and constants; communication links are identified by names
Encoding MaxCSP into . . .
"... We define a number of original encodings that map MaxCSP instances into Partial MaxSAT instances. Our encodings rely on the wellknown direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encod ..."
Abstract
 Add to MetaCart
We define a number of original encodings that map MaxCSP instances into Partial MaxSAT instances. Our encodings rely on the wellknown direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our
The logsupport encoding of CSP into SAT
 In Proceedings of CP2007
, 2007
"... Abstract. It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT solver will efficiently find a solution is still an open question. Various encodings have been proposed in the ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract. It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT solver will efficiently find a solution is still an open question. Various encodings have been proposed
Deconstructing CCS and CSP Asynchronous Communication, Fairness, and Full Abstraction
"... The process algebras CCS and CSP assume that processes interact by means of handshake communication, although it would have been equally reasonable to have adopted asynchronous communication as primitive. Traditional semantics of CCS (based on bisimulation) and CSP (such as the failures model) do no ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The process algebras CCS and CSP assume that processes interact by means of handshake communication, although it would have been equally reasonable to have adopted asynchronous communication as primitive. Traditional semantics of CCS (based on bisimulation) and CSP (such as the failures model) do
Compiling finite linear CSP to SAT
 In Proceedings of CP2006, volume 4204 of LNCS
, 2006
"... Abstract. In this paper, we propose a method to encode Constraint Satisfaction Problems (CSP) and Constraint Optimization Problems (COP) with integer linear constraints into Boolean Satisfiability Testing Problems (SAT). The encoding method is basically the same with the one used to encode JobShop ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
Abstract. In this paper, we propose a method to encode Constraint Satisfaction Problems (CSP) and Constraint Optimization Problems (COP) with integer linear constraints into Boolean Satisfiability Testing Problems (SAT). The encoding method is basically the same with the one used to encode Job
Implementing CCS, the LCS experiment
, 1989
"... machine is implemented with 8 registers and the stack. These registers are E (environment, a linked list), C (the cell packing the code), PC (program counter), R (resumption register, a stack height), P (process positions, encoded as pairs of values), L (process lines, encoded as linked lists), G (p ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
machine is implemented with 8 registers and the stack. These registers are E (environment, a linked list), C (the cell packing the code), PC (program counter), R (resumption register, a stack height), P (process positions, encoded as pairs of values), L (process lines, encoded as linked lists), G
On the Expressiveness of CCS with Replication
 TECHNICAL REPORT, LIX ECOLE POLYTECHNIQUE (2007), URL WWW.CS.UNIBO.IT/~DIGIUSTO/RESEARCH/CCSREP.PDF
, 2007
"... A remarkable result in [4] shows that in spite of its being strictly less expressive than CCS w.r.t. weak bisimilarity, CCS! (a CCS variant where infinite behavior is specified by using replication rather than recursion) is Turing powerful. This is done by encoding Random Access Machines (RAM) in C ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A remarkable result in [4] shows that in spite of its being strictly less expressive than CCS w.r.t. weak bisimilarity, CCS! (a CCS variant where infinite behavior is specified by using replication rather than recursion) is Turing powerful. This is done by encoding Random Access Machines (RAM
Results 1  10
of
469