Using Petri nets to detect synchronization issues in computer shared memory systems

Бесплатный доступ

This paper deals with aspects related to the use of Petri nets to detect synchronization issues in concurrent programs using shared memory. Transformation patterns to convert basic synchronization primitives into the Petri nets model are given. Siphons are used to determine the activity of Petri nets. The problem of deadlocks absence in Petri nets reduces to a mathematical programming problem.

Petri nets, deadlocks absence, mathematical programming, multithreaded programming, synchronization primitive

Короткий адрес: https://sciup.org/142185834

IDR: 142185834

Статья научная