Czech digital mathematics library · 2005 · 34 citations · 10 references
Open access
ComputingComputer ScienceMathematicsComputational GeometryModel-based Systems EngineeringSystems ModelingDiscrete-event System ModelingEquivalence CheckingModel CheckingPetri NetsDiscrete-event ModelingDiscrete-event SystemsPetri Net ModelsPolynomial-time AlgorithmsSystem Observability
summary:This work is concerned with observability in Discrete Event Systems (DES) modeled by Interpreted Petri Nets (IPN). Three major contributions are presented. First, a novel geometric characterization of observability based on input-output equivalence relations on the marking sequences sets is presented. Later, to show that this characterization is well posed, it is applied to linear continuous systems, leading to classical characterizations of observability for continuous systems. Finally, this paper translates the geometric characte-rization of observability into structural properties of the IPN. Thus, polynomial algorithms can be derived to check the observability in a broad class of IPN.
10
Petri nets: Properties, analysis and applications
T. Murata · Proceedings of the IEEE · 1989 · 10.5K citations