No label defined (Q3736897)
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 3970098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3970098 |
Statements
1986
0 references
flow net
0 references
flowchart
0 references
flow-of-control algebra
0 references
flow structures
0 references
recursion equations
0 references
Deadlock
0 references
equivalence
0 references
0.7780370712280273
0 references
0.7601780891418457
0 references
0.7485445141792297
0 references
[For the entire collection see Zbl 0595.00023.] A mathematical model is presented as a common framework within which to discuss and compare different models of concurrent computation. Central to the model is the concept of flow net, which is used to describe concurrent computation, just as a conventional flowchart is used to describe serial computation. A flow-of-control algebra of flow nets is presented by defining a minimal set of operations for composing flow nets, together with an equational system they satisfy. These operations suggest a corresponding minimal syntax - the flow-of-control algebra of flow structures. In this algebra, which is continuous, a flow net is represented by its unfoldment - a finite system of recursion equations. Deadlock and equivalence are examples of properties of concurrent computation formulated in the presented syntax.
0 references