Abstract Compositional Analysis of Iterated Relations - A Structural Approach to Complex State Transition Systems (Paperback, 1998 ed.)

State-transition systems model machines, programs, and speci?cations [20, 23,284,329],butalsothegrowthanddeclineofantpopulations,?nancial markets, diseases and crystals [22, 35, 178, 209, 279]. In the last decade, thegrowinguseofdigitalcontrollersinvariousenvironmentshasentailed theconvergenceofcontroltheoryandreal-timesystemstowardhybrids- tems [16] by combining both discrete-event facets of reality with Nature's continuous-time aspects. The computing scientist and the mathematician have re-discovered each other. Indeed, in the late sixties, the programming language Simula, "father" of modern object-oriented languages, had already been speci?cally designed to model dynamical systems [76]. Today,theimportanceofcomputer-basedsystemsinbanks,telecom- nication systems, TVs, planes and cars results in larger and increasingly complex models. Two techniques had to be developed and are now fruitfully used to keep analytic and synthetic processes feasible: composition and - straction.Acompositionalapproachbuildssystemsbycomposingsubsystems that are smaller and more easily understood or built. Abstraction simpli?es unimportantmattersandputstheemphasisoncrucialparametersofsystems. Inordertodealwiththecomplexityofsomestate-transitionsystemsand tobetterunderstandcomplexorchaoticphenomenaemergingoutofthe behaviorofsomedynamicalsystems,theaimofthismonographistopresent ?rststepstowardtheintegratedstudyofcompositionandabstractionin dynamical systems de?ned by iterated relations. Themaininsightsandresultsofthisworkconcernastructuralorm f of complexityobtainedbycompositionofsimpleinteractingsystemspresenting opposedattractingbehaviors.Thiscomplexityexpressesitselfintheevo- tionofcomposedsystems,i.e.,theirdynamics,andintherelationsbetween their initial and ?nal states, i.e., the computations they realize. The theor- ical results presented in the monograph are then validated by the analysis ofdynamicalandcomputationalpropertiesoflow-dimensionalprototypesof chaotic systems (e.g. Smale horseshoe map, Cantor relation, logistic map), high-dimensional spatiotemporally complex systems (e.g. cellular automata), and formal systems (e.g. paperfoldings, Turing machines). Acknowledgements. ThismonographisarevisionofmyPhDthesiswhichwas completed at the Universit' e catholique de Louvain (Belgium) in March 96. VIII Preface The results presented here have been in?uenced by many people and I would like to take this opportunity to thank them all.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Computer Science, 1426
Release date:	2001
First published:	1998
Authors:	Frederic Geurts
Dimensions:	235 x 155 x 15mm (L x W x T)
Format:	Paperback
Pages:	280
Edition:	1998 ed.
ISBN-13:	978-3-540-65506-0
Categories:	Books > Computing & IT > General theory of computing > Systems analysis & design Promotions
LSN:	3-540-65506-9
Barcode:	9783540655060

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!