On the consistency of Koomen's fair abstraction rule
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.
Recursive Definition \& Specification Principles
scientific article; zbMATH DE number 4007704
scientific article