Taking advantages of temporal redundancy in high level petri nets implementations

Abstract

The aim of this paper is to present a software implementation technique for High Level Petri Nets. The proposed technique, implemented for a specialized version of HLPN called KRON, is interpreted and centralized. The approach makes use of the similarities between the inference engine of a rule based system and the interpretation mechanism of a HLPN. It performs an adaptation of the RETE matching algorithm to deal with HLPN implementations. As in RETE, the main objective is to exploit the data temporal redundancy, with this purpose, a RETE-like data structure is implemented. Additionally, our approach benefits from the partition of working memory facilitated by the HLPN. These peculiarities allow the generation of simpler data structures than the ones in more general production systems such as OPS5.