Verifying the Correctness of Parallel Logical Control Algorithms.

For the most recent entries see the Petri Nets Newsletter.

Verifying the Correctness of Parallel Logical Control Algorithms.

In: Programmirovanie (USSR), Vol. 13, No. 5, pages 31-35. 1987. In Russian.

Also in: Program. Comput. Softw. (USA), Vol. 13, No. 5, pages 218-221. 1987. English translation.

Abstract: An algorithm of the type examined is termed correct if it is compact, restorable, noncontradictory, stable, and self-consistent. Formal methods are proposed for verifying these properties, including Petri nets.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography