Can skeletons really be used to detect deadlocks of nets?

Abstract

Vautherin's results relating the behaviour of classes of coloured (high-level) Petri nets t o ordinary Petri nets (skeletons for the classes are examined, and theirThe feasibility of using skeletons for the purpose of Y r s t estimate' verifications of nets (in particular, for the early detection of deadlocks, i.e. reachable dead is considered. It is found that because th.e relations marking? ip established b y Vautherin bet,weelz the dead markings of a coloured net and those of the corresponding skeleton does not differentiate between reach,-able and unreachable markings, deadlock-freeness of a coloured net and deadlock-freeness of its skeletons are essentially independent properties. usefulness and ease of app / ication are investigated.