Abstract Compositional Analysis of Iterated Relations
Abstract Compositional Analysis of Iterated Relations
Regular price
Checking stock...
Regular price
Checking stock...
Proud to be B-Corp
Our business meets the highest standards of verified social and environmental performance, public transparency and legal accountability to balance profit and purpose. In short, we care about people and the planet.
The feel-good place to buy books
- Free delivery in Australia
- Supporting authors with AuthorSHARE
- 100% recyclable packaging
- Proud to be a B Corp – A Business for good
- Buy-back with Ziffit
Abstract Compositional Analysis of Iterated Relations by Frederic Geurts
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.| SKU | Unavailable |
| ISBN 13 | 9783540655060 |
| ISBN 10 | 3540655069 |
| Title | Abstract Compositional Analysis of Iterated Relations |
| Author | Frederic Geurts |
| Series | Lecture Notes In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 1998-12-18 |
| Number of pages | 280 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |