For the most recent entries see the Petri Nets Newsletter.

Petri Nets and Abstract Data Types.

Reisig, Wolfgang

Report TUM-I8904. München: Technische Universiät, Institut für Informatik, 1989.

Abstract: Petri nets gain a great deal of modelling power by representing dynamically changing items as structured tokens. Algebraic specifications turn out adequate for dealing with structured items. The author uses this formalism to construct Petri nets with structured tokens. Place- and transition-invariants are useful analysis techniques for conventional Petri nets. The author derives corresponding formalisms for nets with structured tokens, based on term substitution.

Keywords: abstract data type; structured token; place/transition invariant.


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

Back to the Petri Nets Bibliography