We introduce a temporal logic for the polyadic ß-calculus based on fixed point extensions of Hennessy-Milner logic. Features are added to account for parametrisation, generation, and passing of names, including the use, following Milner, of dependent sum and product to account for (unlocalised) input and output, and explicit parametrisation on names using lambda-abstraction and application. The latter provides a single name binding mechanism supporting all parametrisation needed. A proof system and decision procedure is developed based on Stirling and Walker's approach to model checking the modal ¯-calculus using constants. One difficulty, for both conceptual and efficiency-based reasons, is to avoid the explicit use of the !-rule for parametrised processes. A key idea, following Hennessy and Lin's approach to deciding bisimulation for certain types of value-passing processes, is the relativisation of correctness assertions to conditions on names. Based on this idea a proof system and ...

We give sound and complete proof systems for a variety of bisimulation based equivalences over a message-passing process algebra. The process algebra is a generalisation of pure CCS where the actions consist of receiving and sending messages or data on communication channels; the standard prefixing operator a:p is replaced by the two operators c?x:p and c!e:p and in addition messages can be tested by a conditional construct. The various proof systems are parameterised on auxiliary proof systems for deciding on equalities or more general boolean identities over the expression language for data. The completeness of these proof systems are thus relative to the completeness of the auxiliary proof systems.

Abstract not found

We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulation-based semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an extension of Hennessy-Milner logic including a constructive implication, or function space constructor. This result is a non-trivial extension of the classical characterization result for labelled transition systems. In the second part of the paper we address the problem of developing a proof system for the verification of process specifications. Building on previous work for CCS we present an infinitary sound and complete proof system for the fragment of the calculus not handling restriction. Keywords: Higher-order process calculi; Bisimulation; Modal logics; Program specification; Program verif...

We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition systems.

In this chapter we give a survey of the semantic theory for value-passing processes, focusing on bisimulation equivalences. The emphasis is on the symbolic method. Both operational and proof theoretic approaches are described and their expressiveness compared.

A general class of languages and denotational models for value-passing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete language is given, an instantiation of the general class. An equationally based proof system is defined and shown to be sound and complete with respect to the model.

. A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined, following the approach taken for message passing CCS in [HL95a], altered to take account of the particular features of LOTOS (multi-way synchronisation, value negotiation, selection predicates). Symbolic bisimulation over symbolic transition systems is defined, and symbolic bisimulation on ground behaviour expressions is shown to preserve the usual concrete (strong) bisimulation on the standard semantics. Finally, a modal logic based on symbolic transition systems is defined. All are illustrated with reference to examples. 1 Introduction Full LOTOS 4 is a message passing process algebra which combines some features of both CSP [Hoa85] and CCS [Mil89]. In order to accommodate multi-way synchronisation, i.e. associative synchronisation between two or more processes, the standard semantics of LOTOS gives meaning only to processes with ground data; the semantics is in terms of structured labelled ...

This paper shows how predicate equation systems (PESs) may be used to solve model-checking problems for systems, such as those involving real-time or value passing, that manipulate data. PESs are first defined and the encoding of model-checking problems described; then generic global and local approaches for solving PESs are given. Real-time model checking is then considered in detail, and a new, efficient on-the-fly technique for real-time model checking based on proof search in PESs is developed and experimentally shown to significantly outperform existing approaches when system specifications or formula specifications contain errors and to be competitive when both are correct.

©Copyright in this paper belongs to the author(s) Published in collaboration with the