Cart (Loading....) | Create Account
Close category search window
 

Observability of place/transition nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Giua, A. ; Dept. of Electr. & Electron. Eng., Cagliari Univ., Italy ; Seatzu, C.

We discuss the problem of estimating the marking of a place/transition (P/T) net based on event observation. We assume that the net structure is known while the initial marking is totally or partially unknown. We give algorithms to compute a marking estimate that is a lower bound of the actual marking. The special structure of Petri nets allows us to use a simple linear algebraic formalism for estimate and error computation. The error between actual marking and estimate is a monotonically nonincreasing function of the observed word length, and words that lead to error are said to be complete. We define several observability properties related to the existence of complete words, and show how they can be proved. To prove some of them, we also introduce a useful tool, the observer coverability graph, i.e., the usual coverability graph of a P/T net augmented with a vector that keeps track of the estimation error on each place of the net. Finally, we show how the estimate generated by the observer may be used to design a state feedback controller for forbidden marking specifications.

Published in:

Automatic Control, IEEE Transactions on  (Volume:47 ,  Issue: 9 )

Date of Publication:

Sep 2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.