Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
State Properties
verfasst von : Wolfgang Reisig
Erschienen in: Understanding Petri Nets
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Important properties of a system pertain to the system’s reachable states. In a system net
N
, those are the reachable markings. We represent such a
state property E
of
N
with an expression
a
that contains as variables the places of
N
. If, for a marking
M
, each place
p
in
a
is then replaced with
M
(
p
), the expression can be evaluated to either
true
(“
E
holds in
M
”) or
false
(“
E
does not hold in
M
”).
State properties are often expressed as linear equations or inequalities. This chapter covers the
form
and the validity of such equations and inequalities. How to
prove
their validity is covered in the following chapters. As an example, we start out with properties of the cookie vending machine. The form of linear equations and inequalities is very simple and is explained in the second section. This is followed by further examples, and finally by ideas about variants of linear equations and inequalities.