For the most recent entries see the Petri Nets Newsletter.

Analyzing Deadlocks and Livelocks in Concurrent Ada Programs Using Extended Petri Nets.

Cheng, J.; Ushijima, K.

In: Faculty of Engineering Kyushu Univ, Fukuoka, Japan, Memoirs of the Faculty of Engineering, Kyushu University, Vol. 48, No. 2, pages 153-165. 1988.

Abstract: This paper shows that deadlocks and livelocks in a concurrent Ada program can be analyzed using Petri net theory. The authors model tasking behaviors of concurrent Ada programs by extended Petri nets and analyze the modeled programs by linear algebra methods.

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

Back to the Petri Nets Bibliography