On the consistency of Koomen's fair abstraction rule
type: Item
instance of: scholarly article
title: On the consistency of Koomen's fair abstraction rule
zbMATH Open document ID: 0621.68010
DOI: 10.1016/0304-3975(87)90052-1
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/1704
review text: We construct a graph model for ACP, the algebra of communicating processes with silent steps, in which Koomen's Fair abstraction Rule (KFAR) holds, and also versions of the Approximation Induction Principle (AIP) and the Recursive Definition \& Specification Principles (RDP\&RSP). We use this model to prove that in \(ACP_{\tau}\), (but not in ACP!) each computably recursively definable process is finitely recursively definable.
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4007704
zbMATH Keywords: process algebra
zbMATH Keywords: concurrency
zbMATH Keywords: graph model for ACP
zbMATH Keywords: algebra of communicating processes
zbMATH Keywords: Approximation Induction Principle
zbMATH Keywords: Recursive Definition \& Specification Principles
author: Jos C. M. Baeten
author: J. A. Bergstra
author: Jan Willem Klop
MaRDI profile type: Publication
OpenAlex ID: W2106934908
cites work: Q4727412
cites work: Q3347277
cites work: Q3664418
cites work: Algebra of communicating processes with abstraction
cites work: Q3727367
cites work: Q3939218
cites work: Q3792231
cites work: Q3742698
cites work: Top-down design and the algebra of communicating processes
cites work: A fair calculus of communicating systems
cites work: Q3753475
cites work: Axiomatising finite delay operators
cites work: Q3681913
cites work: Algebraic specification and verification of communication protocols
cites work: Fixed point equations with parameters in the projective model
cites work: Merging regular processes by means of fixed-point theory
cites work: A calculus of communicating systems
cites work: Q3907077
cites work: The algebra of communicating processes with empty process
cites work: Q3761680
cites work: Q4732097
description: scientific article; zbMATH DE number 4007704