Premium
MARKING ESTIMATION OF PETRI NETS WITH PAIRS OF NONDETERMINISTIC TRANSITIONS
Author(s) -
Giua Alessandro,
Seatzu Carla,
Júlvez Jorge
Publication year - 2004
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1111/j.1934-6093.2004.tb00204.x
Subject(s) - nondeterministic algorithm , petri net , set (abstract data type) , stochastic petri net , word (group theory) , computer science , algorithm , theoretical computer science , net (polyhedron) , transition (genetics) , mathematics , programming language , biochemistry , chemistry , geometry , gene
We present a technique for estimating the marking of a Petri net based on the observation of transition labels. In particular, the main contribution of the paper consists in deriving a methodology that can handle the case of nondeterministic transitions, i.e., transitions that share the same label. Under some technical assumptions, the set of markings consistent with an observation can be represented by a linear system with a fixed structure that does not depend on the length of the observed word.