No label defined (Q3330491)
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 3862421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3862421 |
Statements
1984
0 references
hierarchical and modular systems
0 references
composition tools
0 references
system architectures
0 references
concurrency
0 references
communicating processes
0 references
process algebra
0 references
fixed point equations
0 references
handshaking
0 references
0.7843427658081055
0 references
0.7831054329872131
0 references
0.78291916847229
0 references
0.7797620296478271
0 references
[For the entire collection see Zbl 0533.00026.] This paper considers a variety of computer systems and collects a set of informal principles concerning their hierarchical construction. These ideas are readily transformed into an elementary formal account of systems in which levels of abstraction are represented by algebras and the relationship between levels are represented by homomorphism. The algebraic approach to systems is then exemplified in an algebraic theory of concurrent systems based on a set of axioms called ACP (algebra of communicating processes). These axioms for concurrent processes are in part modeled on the calculi of R. Milner (CCS, calculus of communicating systems). The aspect of abstraction ('hiding') is not dealt with in ACP, but it can be dealt with in an extension of ACP. The paper finally discusses several theorems concerning ACP.
0 references