Titlebook: Computer Aided Systems Theory - EUROCAST ‘93; A Selection of Paper Franz Pichler,Roberto Moreno Díaz Conference proceedings 1994 Springer-V

合群

波动

Formal methods and their future,higher levels of abstraction. In this paper we show how formal reasoning tools may be used to help address this complexity problem and allow the designer to explore the design space with impunity, thanks to the rigour afforded by the mathematical formalism, in the sure knowledge that the final desig

parasite

abduction

ULCER

An algebraic transformation of the minimum automaton identification problem, all simplest hypotheses explaining a given set of input-experiments is performed. It is shown that the minimum identification problem is polynomially transformable into a problem of determining a simplest congruence of the so-called basic hypothesis. It is proved that the method produces a weakly e

acolyte

On possibilistic automata, Possibilistic automata are analogous to stochastic automata where stochastic (+/×) semirings are replaced by possibilistic (∨/∧) semirings; but where stochastic automata must be normal, fuzzy automata may be (resulting in possibilistic automata) or may not be (resulting in fuzzy automata proper). W

ANT

On automatic adjustment of the sampling period,dure of the sampling period that tries to maintain constant the number of samples during the rise time If the sampling period is modified obviously the parameters of the discrete model will change. However from the knowledge of the initial sampling period, the final sampling period and the initial v

Nomogram

野蛮

microscopic