Reduction rules for reset/inhibitor nets

H.M.W. Verbeek, M.T. Wynn, W.M.P. Aalst, van der, A.H.M. Hofstede, ter

Research output: Contribution to journalArticleAcademicpeer-review

26 Citations (Scopus)

Abstract

Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancellation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An inhibitor arc can stop a transition from being enabled if the place contains one or more tokens. While reset/inhibitor nets increase the expressive power of Petri nets, they also result in increased complexity of analysis techniques. One way of speeding up Petri net analysis is to apply reduction rules. Unfortunately, many of the rules defined for classical Petri nets do not hold in the presence of reset and/or inhibitor arcs. Moreover, new rules can be added. This is the first paper systematically presenting a comprehensive set of reduction rules for reset/inhibitor nets. These rules are liveness and boundedness preserving and are able to dramatically reduce models and their state spaces. It can be observed that most of the modeling languages used in practice have features related to cancellation and blocking. Therefore, this work is highly relevant for all kinds of application areas where analysis is currently intractable.
Original languageEnglish
Pages (from-to)125-143
JournalJournal of Computer and System Sciences
Volume76
Issue number2
DOIs
Publication statusPublished - 2010

Fingerprint

Dive into the research topics of 'Reduction rules for reset/inhibitor nets'. Together they form a unique fingerprint.

Cite this