Internal Report CEDRIC-IIE. Evry, France: Conservatoire National des Arts et Métiers, 1989.
Abstract: Over the last few years, several attempts to associate abstract data types to Petri nets have been made. This would allow to benefit from the facility and correctness of data manipulation to produce correct systems even at the data level. For algebraic nets (defined by Vautherin) the authors introduce several results concerning termination and various reachable marking trees. Finally, a computer-based environment for these nets is presented.
Keywords: algebraic net (in practice); abstract data type; termination; reachable marking tree; (computer-based) net environment.