Verifying the correctness of parallel logical control algorithms (Q1111014)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Verifying the correctness of parallel logical control algorithms |
scientific article; zbMATH DE number 4074469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verifying the correctness of parallel logical control algorithms |
scientific article; zbMATH DE number 4074469 |
Statements
Verifying the correctness of parallel logical control algorithms (English)
0 references
1987
0 references
An algorithm of the type examined in the article is termed correct if it is compact, restorable, noncontradictory, stable, and self-consistent. Formal methods are proposed for verifying these properties, including Petri nets.
0 references
correctness
0 references
parallel logical control algorithms
0 references
Petri nets
0 references
0.9449988
0 references
0.9210049
0 references
0 references
0.89030015
0 references
