The University of Southampton
University of Southampton Institutional Repository

Modal Logic and Equality for Process Algebra

Modal Logic and Equality for Process Algebra
Modal Logic and Equality for Process Algebra
This paper provides a denotational semantics for the ‘saturation method’, described by J. A. Bergstra and J. W. Klop, in the form of a modal logic. In particular the semantics describes congruence for CCS processes in the form of a modal logic whose axioms are a modal representation of the tau laws. The main idea of the paper is to represent bisimulation equivalences of CCS in terms of a simple modal logic K. This logic is a variant of the classical modal logic K introducing a plus operator to mirror the choice operator of CCS. Weak bisimulation equivalence and process equality can be characterized in terms of extra axioms added to K. In the case of equality the axioms are a modal representation of the tau laws. A CCS process maps to a model of the logic; two processes are equivalent if they map to the same model.
121-136
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049
Mitchell, Bill
5d045751-9ef4-4375-9e89-dbae07c90049

Mitchell, Bill (1996) Modal Logic and Equality for Process Algebra. Journal of Logic and Computation, 6 (1), 121-136. (doi:10.1093/logcom/6.1.121).

Record type: Article

Abstract

This paper provides a denotational semantics for the ‘saturation method’, described by J. A. Bergstra and J. W. Klop, in the form of a modal logic. In particular the semantics describes congruence for CCS processes in the form of a modal logic whose axioms are a modal representation of the tau laws. The main idea of the paper is to represent bisimulation equivalences of CCS in terms of a simple modal logic K. This logic is a variant of the classical modal logic K introducing a plus operator to mirror the choice operator of CCS. Weak bisimulation equivalence and process equality can be characterized in terms of extra axioms added to K. In the case of equality the axioms are a modal representation of the tau laws. A CCS process maps to a model of the logic; two processes are equivalent if they map to the same model.

Other
Equality_Processes.ps - Other
Download (459kB)

More information

Published date: 1996
Organisations: Electronics & Computer Science, IT Innovation

Identifiers

Local EPrints ID: 266058
URI: http://eprints.soton.ac.uk/id/eprint/266058
PURE UUID: a80499e1-e72c-43a8-a949-1860ebf3fc1c

Catalogue record

Date deposited: 04 Jul 2008 20:30
Last modified: 14 Mar 2024 08:20

Export record

Altmetrics

Contributors

Author: Bill Mitchell

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×