1,721,352 research outputs found

    Model reduction of finite state machines by contraction

    Full text link
    This note discusses an approach to the model reduction of discrete event systems represented by finite-state machines. A set of good reduced-order approximations of a deterministic finite-state machine M can be efficiently computed by looking at its contractions, i.e., finite-state machines constructed from M by merging two states. In some particular case, it is also possible to prove that the approximations thus constructed are infimal, in the sense that there do not exist better approximations with the same number of states. This note also defines a merit function to choose, among a set of approximations, the best one with respect to a given observed behavior

    State Estimation and Fault Detection Using Petri Nets

    No full text
    This extended abstract serves as a support for the plenary address given by the author at the 32nd International Conference on Application and Theory of Petri Nets and Concurrency

    Welcome message from the program chair

    No full text
    On behalf of the Program Committee I am very pleased to welcome you to the 2011 IEEE International Conference on Automation Science and Engineering, that will be held on Aug 24-27, 2011 in Trieste, Italy

    High-Level Hybrid Petri Nets: a Definition

    No full text
    The paper presents a model which provides a simple graphical representation of hybrid systems and takes advantage of the modular structure of Petri nets in giving a compact description of systems composed of interacting subsystems, both time-continuous and discrete-event. The modelling formalism seems rich enough to encompass large classes of hybrid systems and can easily represent many of the features of the models given in the literature
    corecore