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

Invariant subspaces and sensor placement for observability in Continuous Timed Petri 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

3 Author(s)
Aguayo-Lara, E. ; Res. & Adv. Studies Center, Nat. Polytech. Inst., Guadalajara, Mexico ; Ramirez-Trevino, A. ; Ruiz-Leon, J.

This work deals with the problem of sensor placement for observability in Continuous Timed Petri Nets (ContPN) with infinite server semantics. ContPN are represented by a family of linear systems F = Σ1 = (A1, B1, S1), ..., Σn = (An, Bn, Sn) switching between them. The observability in ContPN requires the observability of each linear system Σk and the distinguishability of each pair of systems Σk, Σj. Thus this work uses the well known result that a system Σk is observable iff the maximum Ak-invariant subspace contained in the kernel of Sk is the null space to build output functions Sk in such a way that the ContPN becomes observable. This work characterizes the Ak-invariant subspaces associated to nonzero eigenvalues from the ContPN incidence matrix and the others Ak-invariant subspaces from the ContPN structure. Using this information an output matrix S = S1 = ... = Sn is computed in such a way that no Ak-invariant subspace is contained in the kernel of S. From the construction of S we can guarantee that every pair of systems is distinguishable from each other. Thus the ContPN becomes observable.

Published in:

Automation Science and Engineering (CASE), 2011 IEEE Conference on

Date of Conference:

24-27 Aug. 2011

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.