For the most recent entries see the Petri Nets Newsletter.

Taking Advantages of Temporal Redundancy in High Level Petri Nets Implementations.

Banares, J.A.; Muro-Medrano, P.R.; Villarroel, J.L.

In: Ajmone Marsan, M.: Lecture Notes in Computer Science, Vol. 691; Application and Theory of Petri Nets 1993, Proceedings 14th International Conference, Chicago, Illinois, USA, pages 32-48. Springer-Verlag, 1993.

Abstract: The aim of this paper is to present a software implementation technique for High LevelPetri 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 adaption 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.

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

Back to the Petri Nets Bibliography