Model Reduction of Finite State Machines by Contraction

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.

Model Reduction of Finite State Machines by Contraction / GIUA A. - In: IEEE TRANSACTIONS ON AUTOMATIC CONTROL. - ISSN 0018-9286. - 46:5(2001), pp. 797-801.

Trovami (UniCASearch)


Titolo: Model Reduction of Finite State Machines by Contraction
Autori: 
GIUA, ALESSANDRO
Data di pubblicazione: 2001
Rivista: 
IEEE TRANSACTIONS ON AUTOMATIC CONTROL  
Citazione: Model Reduction of Finite State Machines by Contraction / GIUA A. - In: IEEE TRANSACTIONS ON AUTOMATIC CONTROL. - ISSN 0018-9286. - 46:5(2001), pp. 797-801.
Handle: http://hdl.handle.net/11584/665
Tipologia:1.1 Articolo in rivista

File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2021