Jump to content

Prioritised Petri net

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by FrescoBot (talk | contribs) at 07:32, 17 July 2019 (Bot: link syntax and minor changes). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (June 2013) (Learn how and when to remove this message)

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Prioritised Petri net" – news · newspapers · books · scholar · JSTOR (June 2013) (Learn how and when to remove this message)

(Learn how and when to remove this message)

A Prioritised Petri net is a structure (PN, Π) where PN is a Petri net and Π is a priority function that maps transitions into non-negative natural numbers representing their priority level^[1]

The enabled transitions with a given priority k always fire before any other enabled transition with priority j<k.

References

^ Gianfranco Balbo, "Introduction to Stochastic Petri Nets p. 101", Dipartimento di Informatica, Italy

Sources

B. Hruz, M.C.Zhou, "Modeling and Control of Discrete-event Dynamic Systems with Petri Nets and Other Tool", Advanced Control and signal processing, Springer, 2007

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Prioritised_Petri_net&oldid=906646091"

Hidden categories: