Search

In this paper, we consider the on-line estimation of current subsequences for Partially Observable P-time Petri Nets and their starting markings on a sliding horizon composed of steps defined by two successive occurrences of observable transition firings. We propose a general strategy composed of two phases: Phase 1 exploits a simplification of the P-time Petri net under the form of a Timed Petri net; considering a candidate count vector and the relevant starting marking proposed at Phase 1, Phase 2 makes a schedulability analysis by building a system of relations which can be represented by an acyclic conflict-free computation graph. The complete approach avoids the generation of sets which is generally time and space consuming, and provides an optimal solution for each subproblem by using efficient standard tools. [ABSTRACT FROM AUTHOR]

The paper presents an improvement of the n-shifting technique to identify the frequency response of an industrial process using a fully asymmetric and delaying relay. The n-shifting approach allows the calculation of n + 1 points of G(s) by an asymmetric relay experiment. This set of n points is composed of G(0), G(jωosc), ... , G(jnωosc), being ωosc the oscillation frequency, and where G(jωosc) is in most cases located in the third quadrant of the Nyquist map. By delaying the relay output and repeating a similar experiment it can be generated n additional points of G(s) where the first point is G(jω'osc) with 0 < ω'osc < ωosc. In this way, it is possible to depict the full output spectrum of G(s) from zero to very high frequencies by a short relay experiment. An example of identification and tuning of a PID controller with data from the n-shifting are presented to show the validity of the approach. [ABSTRACT FROM AUTHOR]