In: Telecom Australia, Research Laboratories Report 8075. 1991.
Abstract: The specification and verification of various dynamic extensions of the well-known dining philosophers problem, using Many-Sorted Predicate-Transition Nets (MPrT-Nets) and some associated analysis techniques, are investigated. One particular analysis technique using classes of high-level nets, and the relationship between Petri nets and D grammars are also briefly discussed.