On the consistency of Koomen's fair abstraction rule (Q1090103)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4007704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the consistency of Koomen's fair abstraction rule |
scientific article; zbMATH DE number 4007704 |
Statements
On the consistency of Koomen's fair abstraction rule (English)
0 references
1987
0 references
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.
0 references
process algebra
0 references
concurrency
0 references
graph model for ACP
0 references
algebra of communicating processes
0 references
Approximation Induction Principle
0 references
Recursive Definition \& Specification Principles
0 references
0.7740686535835266
0 references
0.7493666410446167
0 references
