Contradiction-Tolerant Process Algebra with Propositional Signals

Issue title: Methods for Distributed and Concurrent Systems: Special Issue on the occasion of the 60th Birthday of Professor Gabriel Ciobanu

Guest editors: Bogdan Aman, Jetty Kleijn, Maciej Koutny and Dorel Lucanu

Article type: Research Article

Authors: Bergstra, J.A. | Middelburg, C.A.^*

Affiliations: Informatics Institute, University of Amsterdam, Amsterdam, the Netherlands. {J.A.Bergstra, C.A.Middelburg}@uva.nl

Correspondence: [*] Address for correspondence: Informatics Institute, University of Amsterdam, Science Park 904, 1098 XH Amsterdam, the Netherlands

Abstract: 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 paraconsistent propositional logic which is essentially the same as CLuNs. There are many systems that would have to deal with self-contradictory states if no special measures were taken. For a number of these systems, it is conceivable that accepting self-contradictory states and dealing with them in a way based on a paraconsistent logic is an alternative to taking special measures. The presented version of ACPps can be suited for the description and analysis of systems that deal with self-contradictory states in a way based on the above-mentioned paraconsistent logic.

Keywords: process algebra, propositional signal, propositional condition, paraconsistent logic

DOI: 10.3233/FI-2017-1530

Journal: Fundamenta Informaticae, vol. 153, no. 1-2, pp. 29-55, 2017