Some recent applications of high-level Petri nets

The author presents a tutorial on high-level Petri nets and their applications. The author illustrates the transition firing rule of a high-level Petri net using an example. A high-level net can be considered as a structurally folded version of a regular Petri net, if the number of colors is finite. Thus, a high-level net can be unfolded into a regular Petri net by unfolding each place p into a set of places, one for each color of tokens which p may hold, and by unfolding each transition t into a set of transitions, one for each way that t may fire. The author informally introduces high-level nets through examples. The examples are taken from recent applications of high-level Petri nets to : (1) Horn clause logic programs, (2) four-valued annotated predicate logic, (3) nonmonotonic logic and (4) robot planning