{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[16,2,16,3],[17,2,17,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910143504103321"]
[null,null,"Autore",null,"Geurts Frederic <1965->"]
[null,null,"Titolo",null,"Abstract Compositional Analysis of Iterated Relations : A Structural Approach to Complex State Transition Systems / / by Frederic Geurts"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998"]
[null,null,"ISBN",null,"3-540-49211-9"]
[null,null,"Edizione",null,"[1st ed. 1998.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 280 p. 78 illus.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 1611-3349 ; ; 1426"]
[null,null,"Disciplina",null,"005.73"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Computers, Special purpose"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Computer Science Logic and Foundations of Programming"]
[{"$nulls":4},"Special Purpose and Application-Based Systems"]
[{"$nulls":4},"Software Engineering"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Prologue: Aims, Themes, and Motivations -- Prologue: Aims, Themes, and Motivations -- Mathematical Framework: Iterated Relations and Composition -- Dynamics of Relations -- Dynamics of Composed Relations -- Abstract Complexity: Abstraction, Invariance, Attraction -- Abstract Observation of Dynamics -- Invariance, Attraction, Complexity -- Abstract Compositional Analysis of Systems: Dynamics and Computations -- Compositional Analysis of Dynamical Properties -- Case Studies: Compositional Analysis of Dynamics -- Experimental Compositional Analysis of Cellular Automata -- Compositional Analysis of Computational Properties -- Epilogue: Conclusions and Directions for Future Work."]
[null,null,null,"Sommario/riassunto","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 "]
[{"$nulls":4},"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."]