Contradiction-Tolerant Process Algebra with Propositional Signals

DOI10.3233/FI-2017-1530MaRDI QIDQ4599814zbMATH OpenOpenAlexFDO

Authors J. A. Bergstra, C. A. Middelburg

Publication date 5 January 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.06899

paraconsistent logic process algebra propositional condition propositional signal

Paraconsistent logics (03B53) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

Cited in

(1)

Process algebra with propositional signals

This page was built for publication: Contradiction-Tolerant Process Algebra with Propositional Signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599814)