Milner's Calculus of Communicating Systems (CCS) is extended with a mechanism for label passing - as an attempt to remedy some of the shortcomings of CCS w.r.t. dynamic change of agent interconnections. In the extended calculus, restriction is viewed formally as a binder, and the calculus allows dynamic change of scope (of label) in connection with communication. It is proved that algebraic properties of strong (and observational) equivalence for CCS are preserved by the extension. Examples illustrating the expressive power of the calculus and its methods for reasoning are given
Abstract. CBS is a simple and natural CCS-like calculus where processes speak one at a time and are ...
CBS is a simple and natural CCS-like calculus where processes speak one at a time and are heard inst...
A new class of Petri Nets, called Augmented Condition/Event Systems is defined, by slightly relaxing...
This note is dedicated to Robin Milner. We take the opportunity of looking back on a ten year old re...
AbstractCCS, the Calculus of Communicating Systems devised by Milner, has proved extremely successfu...
AbstractA calculus of higher order communicating systems (CHOCS) was presented by the author in ["Pr...
AbstractA calculus of higher order communicating systems (CHOCS) was presented by the author in ["Pr...
AbstractWe present the π-calculus, a calculus of communicating systems in which one can naturally ex...
This thesis develops two Calculi for Higher Order Communicating Systems Both calculi consider sendi...
A new set of inference rules for the guarded version of Milner’s Calculus of Communicating Systems i...
This thesis develops two Calculi for Higher Order Communicating Systems. Both calculi consider sendi...
AbstractCCS, the Calculus of Communicating Systems devised by Milner, has proved extremely successfu...
In a process-algebraic approach to system verification, one typically writes two specifications. One...
AbstractAssume a communication network, consisting of switching nodes which make connections (like t...
"In a process-algebraic approach to system verification, one typically writes two specifications. On...
Abstract. CBS is a simple and natural CCS-like calculus where processes speak one at a time and are ...
CBS is a simple and natural CCS-like calculus where processes speak one at a time and are heard inst...
A new class of Petri Nets, called Augmented Condition/Event Systems is defined, by slightly relaxing...
This note is dedicated to Robin Milner. We take the opportunity of looking back on a ten year old re...
AbstractCCS, the Calculus of Communicating Systems devised by Milner, has proved extremely successfu...
AbstractA calculus of higher order communicating systems (CHOCS) was presented by the author in ["Pr...
AbstractA calculus of higher order communicating systems (CHOCS) was presented by the author in ["Pr...
AbstractWe present the π-calculus, a calculus of communicating systems in which one can naturally ex...
This thesis develops two Calculi for Higher Order Communicating Systems Both calculi consider sendi...
A new set of inference rules for the guarded version of Milner’s Calculus of Communicating Systems i...
This thesis develops two Calculi for Higher Order Communicating Systems. Both calculi consider sendi...
AbstractCCS, the Calculus of Communicating Systems devised by Milner, has proved extremely successfu...
In a process-algebraic approach to system verification, one typically writes two specifications. One...
AbstractAssume a communication network, consisting of switching nodes which make connections (like t...
"In a process-algebraic approach to system verification, one typically writes two specifications. On...
Abstract. CBS is a simple and natural CCS-like calculus where processes speak one at a time and are ...
CBS is a simple and natural CCS-like calculus where processes speak one at a time and are heard inst...
A new class of Petri Nets, called Augmented Condition/Event Systems is defined, by slightly relaxing...