No label defined (Q4723291)
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 3997155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3997155 |
Statements
1987
0 references
concurrent processes
0 references
incremental design and verification of CSP networks
0 references
non-deterministic program
0 references
mutual exclusion problem
0 references
0.8032934069633484
0 references
0.7826986312866211
0 references
[For the entire collection see Zbl 0608.00014.] An old principle connecting concurrent processes with sequential non- deterministic ones is revisited. Associated with a transformation technique, it leads to a methodology for an incremental design and verification of CSP networks. The starting point is a non-deterministic program. This program and its invariant are transformed step by step into a CSP network, without introducing new variables. The methodology is illustrated by the synthesis of a simple solution to the mutual exclusion problem.
0 references