Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Foundations of System Theory: Finitary and Infinitary Conditions, PDF eBook

Foundations of System Theory: Finitary and Infinitary Conditions PDF

Part of the Lecture Notes in Economics and Mathematical Systems series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

This paper is one of a series in which the ideas of category theory are applied to problems of system theory.

As with the three principal earlier papers, [1-3], the emphasis is on study of the realization problem, or the problem of associating with an input-output description of a system an internal description with something analogous to a state-space.

In this paper, several sorts of machines will be discussed, which arrange themselves in the following hierarchy: Input process Machine Output process (Tree automaton) Machine ~ ~ State-behavior Machine I Adjoint Machine .(Sequential Machine) ., I Decomposable Machine (Linear System, Group Machine) Each member of the hierarchy includes members below it; examples are included in parentheaes, and each example is at its lowest possible point in the hierarchy.

There are contrived examples of output process machines and IV state-behavior machines which are not adjoint machines [3], but as yet, no examples with the accepted stature of linear systems [4], group machines [5, 6], sequential machines [7, Ch. 2], and tree automata [7, Ch. 4].

Information

Information

Also in the Lecture Notes in Economics and Mathematical Systems series  |  View all