Petri Nets Coverability

  • Published 2014


This assignment is concerned with the coverability problem in Petri nets. Formally, given a Petri net N with set of places P , a source marking ms in NP , and a target marking mt in NP , the problem asks whether there exists m in NP such that ms →N m and m ≥ mt. Here (and in the remainder of this assignment), the ordering is the product ordering over NP… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics