Reppy's language CML extends Standard ML of Milner et al. with primitives for communication. It thus inherits a notion of strong polymorphic typing and may be equipped with a structural operational semantics. As a rst step we formulate an eeect system for statically expressing the communication behaviours of CML programs as these are not reeected in the types. As a second step we adapt the stru...

Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, compositional aggregation based on congruence relations can be applied. This paper addresses the computational complexity of minimisation algorit...

In a previous paper, an ACP-style process algebra was proposed in which propositions are used as the visible part of the state of processes and as state conditions under which processes may proceed. This process algebra, called ACPps, is built on classical propositional logic. In this paper, we present a version of ACPps built on a paracon-sistent propositional logic which is essentially the sa...

Process algebra in the form of ACP describes the main features of imperative concurrent programming without explicit mention of time. Implicitly, time is present in the interpretation of sequential composition: in p · q the process p must be executed before q. A quantative view on the relation between process execution and progress of time is absent in ACP, however. Process algebras can be deve...

We propose a combination of Kleene’s three-valued logic and ACP process algebra via the guarded command construct. We present an operational semantics in SOS-style, and a completeness result.  1998 Elsevier Science B.V. All rights reserved.

This paper shows how process algebra can be used to automatically generate verifiable mechanisms for multi-agent systems wherein agents need to trust the system. We make the link between games and process models and then present an iterative algorithm allowing us to generate mechanisms as computer programs implementing given systems’ requirements, which are expressed as constraints and desirabl...

To prove liveness properties of concurrent systems, it is often necessary to postulate progress, fairness and justness properties. This paper investigates how the necessary progress, fairness and justness assumptions can be added to or incorporated in a standard processalgebraic specification formalism. We propose a formalisation that can be applied to a wide range of process algebras. The pres...

Fuzzy systems address the imprecision of the input and output variables, which formally describe notions like “rather warm” or “pretty cold”, while provide a behaviour that depends on fuzzy data. This class of systems are classically represented by means of Fuzzy Inference Systems (FIS), a computing framework based on the concepts of fuzzy if-then rules and fuzzy reasoning. Even if FIS are larg...

In this paper we show how to use McMillan’s complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model. We present a simple adequate order (using an order on process algebra expressions) as an optimization to McMillan’s original algorithm.

We propose a combination of Bochvar’s strict three-valued logic, McCarthy’s sequential three-valued logic, and process algebra via the conditional guard construct. This combination entails the introduction of a new constant meaningless in process algebra. We present an operational semantics in SOS-style, and a completeness result for ACP with conditional guard construct and the proposed logic.