Systems analysis and design Books

Book SynopsisThis title is devoted to presenting some of the most important concepts and techniques for describing real-time systems and analyzing their behavior in order to enable the designer to achieve guarantees of temporal correctness. Topics addressed include mathematical models of real-time systems and associated formal verification techniques such as model checking, probabilistic modeling and verification, programming and description languages, and validation approaches based on testing. With contributions from authors who are experts in their respective fields, this will provide the reader with the state of the art in formal verification of real-time systems and an overview of available software tools.Table of ContentsPreface 15 Stephan MERZ and Nicolas NAVET Chapter 1. Time Petri Nets – Analysis Methods and Verification with TINA 19 Bernard BERTHOMIEU, Florent PERES and Francois VERNADAT 1.1. Introduction 19 1.2. Time Petri nets 20 1.2.1. Definition 20 1.2.2. States and the state reachability relation 20 1.2.3. Illustration 22 1.2.4. Some general theorems 23 1.3. State class graphs preserving markings and LTL properties 24 1.3.1. State classes 24 1.3.2. Illustration 25 1.3.3. Checking the boundedness property on-the-fly 26 1.3.4. Variations 27 1.4. State class graphs preserving states and LTL properties 28 1.4.1. Clock domain 28 1.4.2. Construction of the SSCG 29 1.4.3. Variants 30 1.5. State class graphs preserving states and branching properties 32 1.6. Computing firing schedules 33 1.6.1. Schedule systems 33 1.6.2. Delays (relative dates) versus dates (absolute) 34 1.6.3. Illustration 35 1.7. An implementation: the Tina environment 35 1.8. The verification of SE−LTL formulae in Tina 37 1.8.1. The temporal logic SE−LTL 37 1.8.2. Preservation of LTL properties by tina constructions 39 1.8.3. selt: the SE−LTL checker of Tina 39 1.9. Some examples of use of selt 42 1.9.1. John and Fred 42 1.9.2. The alternating bit protocol 44 1.10. Conclusion 47 1.11. Bibliography 48 Chapter 2. Validation of Reactive Systems by Means of Verification and Conformance Testing 51 Camille CONSTANT, Thierry JERON, Herve MARCHAND and Vlad RUSU 2.1. Introduction 51 2.2. The IOSTS model 54 2.2.1. Syntax of IOSTS 54 2.2.2. Semantics of IOSTS 56 2.3. Basic operations on IOSTS 57 2.3.1. Parallel product 57 2.3.2. Suspension 58 2.3.3. Deterministic IOSTS and determinization 60 2.4. Verification and conformance testing with IOSTS 60 2.4.1. Verification 60 2.4.2. Conformance testing 64 2.5. Test generation 64 2.6. Test selection 68 2.7. Conclusion and related work 70 2.8. Bibliography 73 Chapter 3. An Introduction to Model Checking 77 Stephan MERZ 3.1. Introduction 77 3.2. Example: control of an elevator 78 3.3. Transition systems and invariant checking 79 3.3.1. Transition systems and their runs 81 3.3.2. Verification of invariants 82 3.4. Temporal logic 84 3.4.1. Linear-time temporal logic 84 3.4.2. Branching-time temporal logic 87 3.4.3. ω-automata 89 3.4.4. Automata and PTL 92 3.5. Model checking algorithms 94 3.5.1. Local PTL model checking 95 3.5.2. Global CTL model checking 97 3.5.3. Symbolic model checking algorithms 99 3.6. Some research topics 103 3.7. Bibliography 105 Chapter 4. Model Checking Timed Automata 111 Patricia BOUYER and Francois LAROUSSINIE 4.1. Introduction 111 4.2. Timed automata 112 4.2.1. Some notations 112 4.2.2. Timed automata, syntax and semantics 113 4.2.3. Parallel composition 114 4.3. Decision procedure for checking reachability 115 4.4. Other verification problems 118 4.4.1. Timed languages 118 4.4.2. Branching-time timed logics 118 4.4.3. Linear-time timed logics 120 4.4.4. Timed modal logics 121 4.4.5. Testing automata 121 4.4.6. Behavioral equivalences 121 4.5. Some extensions of timed automata 121 4.5.1. Diagonal clock constraints 122 4.5.2. Additive clock constraints 123 4.5.3. Internal actions 124 4.5.4. Updates of clocks 125 4.5.5. Linear hybrid automata 126 4.6. Subclasses of timed automata 127 4.6.1. Event-recording automata 127 4.6.2. One-clock timed automata 128 4.6.3. Discrete-time models 129 4.7. Algorithms for timed verification 130 4.7.1. A symbolic representation for timed automata: the zones 130 4.7.2. Backward analysis in timed automata 131 4.7.3. Forward analysis of timed automata 132 4.7.4. A data structure for timed systems: DBMs 133 4.8. The model-checking tool Uppaal 134 4.9. Bibliography 135 Chapter 5. Specification and Analysis of Asynchronous Systems using CADP 141 Radu MATEESCU 5.1. Introduction 141 5.2. The CADP toolbox 142 5.2.1. The LOTOS language 143 5.2.2. Labeled transition systems 143 5.2.3. Some verification tools 144 5.3. Specification of a drilling unit 147 5.3.1. Architecture 150 5.3.2. Physical devices and local controllers 152 5.3.3. Main controller – sequential version 155 5.3.4. Main controller – parallel version 157 5.3.5. Environment 158 5.4. Analysis of the functioning of the drilling unit 159 5.4.1. Equivalence checking 159 5.4.2. Model checking 161 5.5. Conclusion and future work 164 5.6. Bibliography 166 Chapter 6. Synchronous Program Verification with Lustre/Lesar 171 Pascal RAYMOND 6.1. Synchronous approach 171 6.1.1. Reactive systems 171 6.1.2. The synchronous approach 172 6.1.3. Synchronous languages 172 6.2. The Lustre language 173 6.2.1. Principles 173 6.2.2. Example: the beacon counter 174 6.3. Program verification 174 6.3.1. Notion of temporal property 175 6.3.2. Safety and liveness 175 6.3.3. Beacon counter properties 175 6.3.4. State machine 175 6.3.5. Explicit automata 176 6.3.6. Principles of model checking 176 6.3.7. Example of abstraction 177 6.3.8. Conservative abstraction and safety 178 6.4. Expressing properties 178 6.4.1. Model checking: general scheme 178 6.4.2. Model checking synchronous program 179 6.4.3. Observers 180 6.4.4. Examples 180 6.4.5. Hypothesis 180 6.4.6. Model checking of synchronous programs 181 6.5. Algorithms 182 6.5.1. Boolean automaton 182 6.5.2. Explicit automaton 182 6.5.3. The “pre ” and “post ” functions 183 6.5.4. Outstanding states 183 6.5.5. Principles of the exploration 184 6.6. Enumerative algorithm 184 6.7. Symbolic methods and binary decision diagrams 185 6.7.1. Notations 185 6.7.2. Handling predicates 186 6.7.3. Representation of the predicates 186 6.7.4. Typical interface of aBDD library 188 6.7.5. Implementation of BDDs 188 6.7.6. Operations on BDDs 189 6.7.7. Notes on complexity 191 6.7.8. Typed decision diagrams 192 6.7.9. Care set and generalized cofactor 194 6.8. Forward symbolic exploration 195 6.8.1. General scheme 196 6.8.2. Detailed implementation 196 6.8.3. Symbolic image computing 198 6.8.4. Optimized image computing 198 6.9. Backward symbolic exploration 201 6.9.1. General scheme 201 6.9.2. Reverse image computing 202 6.9.3. Comparing forward and backward methods 203 6.10. Conclusion and related works 203 6.11. Demonstrations 204 6.12. Bibliography 205 Chapter 7. Synchronous Functional Programming with Lucid Synchrone 207 Paul CASPI, Gregoire HAMON and Marc POUZET 7.1. Introduction 207 7.1.1. Programming reactive systems 207 7.1.2. Lucid Synchrone 211 7.2. Lucid Synchrone 213 7.2.1. An ML dataflow language 213 7.2.2. Stream functions 214 7.2.3. Multi-sampled systems 216 7.2.4. Static values 222 7.2.5. Higher-order features 222 7.2.6. Datatypes and pattern matching 224 7.2.7. A programming construct to share the memory 225 7.2.8. Signals and signal patterns 227 7.2.9. State machines and mixed designs 229 7.2.10. Parametrized state machines 233 7.2.11. Combining state machines and signals 234 7.2.12. Recursion and non-real-time features 236 7.2.13. Two classical examples 236 7.3. Discussion 240 7.3.1. Functional reactive programming and circuit description languages 240 7.3.2. Lucid Synchrone as a prototyping language 241 7.4. Conclusion 242 7.5. Acknowledgment 243 7.6. Bibliography 243 Chapter 8. Verification of Real-Time Probabilistic Systems 249 Marta KWIATKOWSKA, Gethin NORMAN, David PARKER and Jeremy SPROSTON 8.1. Introduction 249 8.2. Probabilistic timed automata 250 8.2.1. Preliminaries 250 8.2.2. Syntax of probabilistic timed automata 252 8.2.3. Modeling with probabilistic timed automata 254 8.2.4. Semantics of probabilistic timed automata 254 8.2.5. Probabilistic reachability and invariance 255 8.3. Model checking for probabilistic timed automata 258 8.3.1. The region graph 258 8.3.2. Forward symbolic approach 261 8.3.3. Backward symbolic approach 266 8.3.4. Digital clocks 273 8.4. Case study: the IEEE FireWire root contention protocol 277 8.4.1. Overview 277 8.4.2. Probabilistic timed automata model 278 8.4.3. Model checking statistics .281 8.4.4. Performance analysis 282 8.5. Conclusion 285 8.6. Bibliography 285 Chapter 9. Verification of Probabilistic Systems Methods and Tools 289 Serge HADDAD and Patrice MOREAUX 9.1. Introduction 289 9.2. Performance evaluation of Markovian models 290 9.2.1. A stochastic model of discrete event systems 290 9.2.2. Discrete-time Markov chains 292 9.2.3. Continuous-time Markov chains 294 9.3. High level stochastic models 297 9.3.1. Stochastic Petri nets with general distributions 297 9.3.2. GLSPN with exponential distributions . 299 9.3.3. Performance indices of SPN 300 9.3.4. Overview of models and methods in performance evaluation 300 9.3.5. The Great SPN tool 301 9.4. Probabilistic verification of Markov chains 303 9.4.1. Limits of standard performance indices 303 9.4.2. A temporal logic for Markov chains 303 9.4.3. Verification algorithms 305 9.4.4. Overview of probabilistic verification of Markov chains 306 9.4.5. The ETMCC tool 307 9.5. Markov decision processes 308 9.5.1. Presentation of Markov decision processes 308 9.5.2. A temporal logic for Markov decision processes 309 9.5.3. Verification algorithms 309 9.5.4. Overview of verification of Markov decision processes 313 9.5.5. The PRISM tool 314 9.6. Bibliography 315 Chapter 10. Modeling and Verification of Real-Time Systems using the IF Toolset 319 Marius BOZGA, Susanne GRAF, Laurent MOUNIER and Iulian OBER 10.1. Introduction 320 10.2. Architecture 322 10.3. The IF notation 324 10.3.1. Functional features 324 10.3.2. Non-functional features 326 10.3.3. Expressing properties with observers 328 10.4. The IF tools 329 10.4.1. Core components 329 10.4.2. Static analysis 332 10.4.3. Validation 333 10.4.4. Translating UML to IF 334 10.5. An overview on uses of IF in case studies 336 10.6. Case study: the Ariane 5 flight program 337 10.6.1. Overview of the Ariane 5 flight program 337 10.6.2. Verification of functional properties 339 10.6.3. Verification of non-functional properties 343 10.6.4. Modular verification and abstraction 344 10.7. Conclusion 345 10.8. Bibliography 347 Chapter 11. Architecture Description Languages: An Introduction to the SAE AADL 353 Anne-Marie DEPLANCHE and Sebastien FAUCOU 11.1. Introduction 353 11.2. Main characteristics of the architecture description languages 356 11.3. ADLs and real-time systems 357 11.3.1. Requirement analysis 357 11.3.2. Architectural views 359 11.4. Outline of related works 360 11.5. The AADL language 362 11.5.1. An overview of the AADL 363 11.6. Case study 365 11.6.1. Requirements 365 11.6.2. Architecture design and analysis with AADL 366 11.6.3. Designing for reuse: package and refinement 377 11.7. Conclusion 380 11.8. Bibliography 381 List of Authors 385 Index 389

Read more less

Book SynopsisLinear systems have all the necessary elements (modeling, identification, analysis and control), from an educational point of view, to help us understand the discipline of automation and apply it efficiently. This book is progressive and organized in such a way that different levels of readership are possible. It is addressed both to beginners and those with a good understanding of automation wishing to enhance their knowledge on the subject. The theory is rigorously developed and illustrated by numerous examples which can be reproduced with the help of appropriate computation software. 60 exercises and their solutions are included to enable the readers to test and enhance their knowledge.Table of ContentsPreface xi Introduction xvii Chapter 1. Reminders and General Points 1 1.1. Lines 1 1.2. Adaptation and stationary waves 4 1.3. Smith chart 6 1.4. Power in a line 6 1.5. Line sections 7 1.6. Lines with losses 9 Chapter 2. Measurements in HF 11 2.1. Material 11 2.2. The power bench11 2.3. Measurements on the network analyzer 14 Chapter 3. Resonant Cavities 25 3.1. Resonance 25 3.2. Coaxial cavities 28 3.3. Quarter-wave cavities 29 Chapter 4. Fabrication and Tuning of Cavities 47 4.1. Standard structures 47 4.2. Materials 53 4.3. Assembly 56 4.4. Temperature stability 58 4.5. Cavity tuning 70 Chapter 5. The Band-pass Filter 83 5.1. The band-pass function 83 5.2. Calculation of a Tchebycheff band-pass 85 5.3. Technologies 87 Chapter 6. The Combline Filter 97 6.1. Architecture 97 6.2. Dimension calculations. Dishal’s Method 105 6.3. Tuning of filters 114 Chapter 7. Channel Multiplexing 129 7.1. Definitions 129 7.2. The duplexer 129 7.3. The combiner 140 Chapter 8. Auxiliary Devices 157 8.1. Introduction 157 8.2. Circulators 157 8.3. The antenna alarms 165 8.4. Loads and attenuators 170 8.5. Reception amplifiers 177 8.6. The impedance adaptor 186 8.7. The 2nd harmonic rejecter 186 Chapter 9. Directive Couplers 189 9.1. Introduction 189 9.2. Technologies 191 9.3. The hybrid transformer 194 9.4. The 180° hybrid ring 196 9.5. The wireline 198 9.6. The “groundless” coupler 199 9.7. The “catnose” coupler 201 9.8. Discrete-elements coupler 202 9.9. Numerical data 204 9.10. Applications 210 Chapter 10. Helical Resonators 213 10.1. Introduction 213 10.2. Functioning 214 10.3. Structures 215 10.4. Tapping and coupling 219 10.5. Quality coefficient 220 10.6. Set-up rules 223 10.7. Applications 224 Chapter 11. Multicouplers 225 11.1. Transmitter multicouplers (TX) 225 11.2. Receiver multicouplers (RX) 235 11.3. TX/RX multicouplers 236 11.4. TMA 240 11.5. Power and intermodulations 243 11.6. Multiband coupling 254 Chapter 12. Utilities 257 12.1. BASIC programs 257 12.2. Varia 264 Chapter 13. Various Questions and Exploratory Ways 271 13.1. The coupler without intrinsic loss 271 13.2. Infinite rejection band-pass 275 13.3. Helix TX multicoupler 276 13.4. Conclusion 278 Bibliography 281 Index 283

Read more less

Book SynopsisIn recent years, the systems designed to support activity in the fields of banking, health, transportation, space, aeronautics, defense, etc. have become increasingly larger and more complex. With the growing maturity of information and communication technologies, systems have been interconnected within growing networks, yielding new capabilities and services through the combination of system functionalities. This has led to a further increasing complexity that has to be managed in order to take advantage of these system integrations. The book is divided into two parts. The first part addresses the concept and practical illustrations of a “system of systems” and is a multidisciplinary introduction to the notion of a “systems of systems” that is discussed extensively in the current scientific and technical literature. After a critical comparison of the different definitions and a range of various practical illustrations, this part provides answers to key questions such as what a system of systems is and how its complexity can be mastered. The second part, described as “systems-of-systems engineering: methods and tools”, focuses on both engineering and modeling, and standardization issues that are critical to deal with the key steps in systems of systems engineering: namely eliciting stakeholder needs, architecture optimization, integration of constituent systems, qualification, and utilization.Table of ContentsAuthor Biographies xv Introduction xix PART 1. SYSTEMS OF SYSTEMS, CONCEPTS AND PRACTICAL ILLUSTRATIONS 1 Chapter 1. Systems of Systems: From Concept to Actual Development 3 Dominique LUZEAUX 1.1. Network omnipresence creating a worldwide environment 3 1.2. Increasing complexity of the environment 5 1.3. Towards a definition of the concept of system of systems 11 1.4. Control of the system of systems 34 1.5. Tools for the control of the system of systems 47 1.6. The need for standardization 56 1.7. The human factor in systems of systems 58 1.8. Budgetary aspects of the systems of systems 68 1.9. The need for governance 70 1.10. Conclusion 75 1.11. Appendix: system of systems’ definitions in literature. 77 1.12. Bibliography 84 Chapter 2. Emergence and Complexity of Systems of Systems 89 Patrice MICOUIN 2.1. Introduction 89 2.2. Matter and shape 90 2.3. Systems 92 2.4. Genesis of concrete systems 99 2.5. Complexity of systems of systems 107 2.6. Systems of systems engineering 111 2.7. Conclusion 115 2.8. Bibliography 116 Chapter 3. Contractual Aspects of the Acquisition and Use of Systems of Systems 119 Danièle VÉRET 3.1. Introduction 119 3.2. An integrated set of components of various natures 121 3.3. Combining people with diversified skills and their contributions 125 3.4. Commitments to coordinate 130 3.5. Ownership rights 142 3.6. The most adapted legal strategies 147 3.7. Conclusion 148 Chapter 4. The Human Factor within the Context of Systems of Systems 149 Jean-René RUAULT 4.1. Introduction 149 4.2. Definition and epistemological aspects 150 4.3. The issue 154 4.4. Current human factors in systems engineering 160 4.5. The organizations’ complexity from the standpoint of social sciences: impacts on the systems of systems 166 4.6. Social sciences implemented within the context of systems of systems 192 4.7. Recognizable good practices in the field of organizations 201 4.8. Conclusion 202 4.9. Acknowledgments 203 4.10. Bibliography 203 Chapter 5. Space Communication and Observation System of Systems 207 Frédéric PRADEILLES and Dominique LUZEAUX 5.1. The dual context of omnipresent information and the commoditization of space 207 5.2. The technical view: an interconnection of ground-based and space-borne systems 209 5.3. Search for functionality and capacity 213 5.4. A logic of exchange on an international scale 214 5.5. Conclusion 220 5.6. Bibliography 221 Chapter 6. Intelligent Transport Systems 223 Michel CHAVRET 6.1. The field of intelligent transport 223 6.2. ACTIF 226 6.3. Practical application 230 6.4. Conclusion 234 6.5. Bibliography 234 Chapter 7. Systems of Systems in the Healthcare Field 235 Jean-René RUAULT 7.1. Introduction 235 7.2. From capability challenges to the design of systems of systems 236 7.3. Personal service, the main characteristic of systems within the healthcare field 239 7.4. Coordination of the medical and paramedical agents, in hospitals and in private practices 242 7.5. The development of information technologies and their interoperability, heart of the healthcare networks issue 245 7.6. Difficulties encountered 256 7.7. Conclusion 258 7.8. Acknowledgments 258 7.9. Bibliography 259 Chapter 8. Critical Infrastructure Protection 261 Jean-Luc ZOLESIO 8.1. General context of critical infrastructure protection 261 8.2. Protection requirements 266 8.3. Security systems of the future 272 8.4. The human factor 285 8.5. Conclusion 290 Chapter 9. Globalization and Systemic Impacts 291 Dominique LUZEAUX, Jean-René RUAULT and Lui KAM 9.1. Introduction 291 9.2. System of systems “globalization” 292 9.3. Beyond the concepts of systems 309 9.4. Globalization’s impact on systems of systems engineering 312 9.5. Conclusion 316 9.6. Appendix: a summary of the properties of nonlinear dynamic systems 317 9.7. Bibliography 318 PART 2. SYSTEMS OF SYSTEMS ENGINEERING, METHODS, STANDARDS AND TOOLS 321 Chapter 10. Methods and Tools for Systems of Systems Engineering 323 Dominique LUZEAUX 10.1. Systems of systems engineering: from the control of complexity to the necessity of a model-driven approach 323 10.2. Architecture 326 10.3. From architecture to detailed design: reference architectures 331 10.4. Requirement traceability and engineering tools 338 10.5. Reverse engineering and impact studies 342 10.6. Distributed simulation tools for model engineering 344 10.7. Global control of operational security via testability 346 10.8. Towards a virtuous circle of simulation-tests to control the tests 352 10.9. Collaborative work tools 357 10.10. Conclusion 360 10.11. Acknowledgements 361 10.12. Bibliography 362 Chapter 11. Model-driven Design and Simulation 363 Lui KAM 11.1. General points 363 11.2. A few definitions 365 11.3. Model-driven engineering 378 11.4. Feedback 385 11.5. Conclusion and perspectives 392 11.6. Bibliography 394 Chapter 12. Standardization in the Field of Systems and Systems of Systems Engineering 399 Jean-René RUAULT and Jean-Pierre MEINADIER 12.1. Introduction 399 12.2. Example of the importance of standards in the interoperability of systems and systems of systems 400 12.3. Standards used in the field of systems and systems of systems 403 12.4. Application and adaptation of system engineering standards in the context of systems of systems 433 12.5. Implementation of standards in the context of systems of systems 438 12.6. Conclusion 439 12.7. Acknowledgements 439 12.8. Appendix A. Standard relative to business process modeling 439 12.9. Appendix B. Standard relative to the Web services business process execution language 443 12.10. Appendix C. Ontology definition metamodel specification 444 12.11. Appendix D. UML profile for DoDAF/MODAF (USA Department of Defense and UK Ministry of Defense Architecture Framework) 446 12.12. Appendix E. Standard relative to software-intensive systems architecture 451 12.13. Appendix F. Unified modeling language 454 12.14. Appendix G. Systems modeling language 457 12.15. Appendix H. Good practices of IT service management, ITIL 461 12.16. Appendix I. Standard relative to IT services management 464 12.17. Appendix J. Software engineering – Product quality 466 12.18. Appendix J.1. Standard ISO 9126, part 1, quality model 466 12.19. Appendix J.2. Standard ISO 9126, part 3, internal metrics 468 12.20. Appendix K. Standard on software product quality requirements and evaluation 468 12.21. Appendix L. Standard on the common criteria for IT security evaluation 469 12.22. Appendix M. Standard relative to a system’s life cycle process 473 12.23. Appendix N. Standard relative to the processes for engineering a system 482 12.24. Appendix O. Standard for the application and management of the systems engineering process 487 12.25. Appendix P. Standard relative to software life cycle processes 494 12.26. Appendix Q. Standard relative to software measurement process 499 12.27. Appendix R. Standard relative to software product evaluation 500 12.28. Appendix S. Standard on systems engineering, product and design data exchange 504 12.29. Appendix T. Standard on the exchange of product model data, products life cycle support 507 12.30. Bibliography 510 Conclusion 513 List of Authors 519 Index 521

Read more less

Book SynopsisDisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents. This distribution is mainly due to privacy and/or security requirements. Therefore, a distributed model allowing a decentralized solving process is more adequate to model and solve such kinds of problem. The distributed constraint satisfaction problem has such properties. Contents Introduction Part 1. Background on Centralized and Distributed Constraint Reasoning 1. Constraint Satisfaction Problems 2. Distributed Constraint Satisfaction Problems Part 2. Synchronous Search Algorithms for DisCSPs 3. Nogood Based Asynchronous Forward Checking (AFC-ng) 4. Asynchronous Forward Checking Tree (AFC-tree) 5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs 6. Corrigendum to “Min-domain Retroactive Ordering for Asynchronous Backtracking” 7. Agile Asynchronous BackTracking (Agile-ABT) Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning 8. DisChoco 2.0 9. Conclusion About the Authors Mohamed Wahbi is currently an associate lecturer at Ecole des Mines de Nantes in France. He received his PhD degree in Computer Science from University Montpellier 2, France and Mohammed V University-Agdal, Morocco in 2012 and his research focused on Distributed Constraint Reasoning.Table of ContentsPREFACE ix INTRODUCTION xiii PART 1. BACKGROUND ON CENTRALIZED AND DISTRIBUTED CONSTRAINT REASONING 1 CHAPTER 1. CONSTRAINT SATISFACTION PROBLEMS 3 1.1. Centralized constraint satisfaction problems 3 1.3. Summary 28 CHAPTER 2. DISTRIBUTED CONSTRAINT SATISFACTION PROBLEMS 29 2.1. Distributed constraint satisfaction problems 29 2.2. Methods for solving DisCSPs 36 2.3. Summary 47 PART 2. SYNCHRONOUS SEARCH ALGORITHMS FOR DISCSPS 49 CHAPTER 3. NOGOOD-BASED ASYNCHRONOUS FORWARD CHECKING (AFC-NG) 51 3.1. Introduction 51 3.2. Nogood-based asynchronous forward checking 53 3.3. Correctness proofs 59 3.4. Experimental evaluation 60 3.5. Summary 68 CHAPTER 4. ASYNCHRONOUS FORWARD-CHECKING TREE (AFC-TREE) 69 4.1. Introduction 69 4.2. Pseudo-tree ordering 70 4.3. Distributed depth-first search tree construction 72 4.4. The AFC-tree algorithm 75 4.5. Correctness proofs 79 4.6. Experimental evaluation 79 4.7. Other related works 85 4.8. Summary 86 CHAPTER 5. MAINTAINING ARC CONSISTENCY ASYNCHRONOUSLY IN SYNCHRONOUS DISTRIBUTED SEARCH 87 5.1. Introduction 87 5.2. Maintaining arc consistency 88 5.3. Maintaining arc consistency asynchronously 89 5.4. Theoretical analysis 94 5.5. Experimental results 95 5.6. Summary 99 PART 3. ASYNCHRONOUS SEARCH ALGORITHMS AND ORDERING HEURISTICS FOR DISCSPS 101 CHAPTER 6. CORRIGENDUM TO “MIN-DOMAIN RETROACTIVE ORDERING FOR ASYNCHRONOUS BACKTRACKING” 103 6.1. Introduction 103 6.2. Background 104 6.3. ABT_DO-Retro may not terminate 106 6.4. The right way to compare orders 108 6.5. Summary 110 CHAPTER 7. AGILE ASYNCHRONOUS BACKTRACKING (AGILE-ABT) 111 7.1. Introduction 111 7.2. Introductory material 113 7.3. The algorithm 117 7.4. Correctness and complexity 120 7.5. Experimental results 123 7.6. Related works 129 7.7. Summary 130 PART 4. DISCHOCO 2.0: A PLATFORM FOR DISTRIBUTED CONSTRAINT REASONING 131 CHAPTER 8. DISCHOCO 2.0 133 8.1. Introduction 133 8.2. Architecture 134 8.3. Using DisChoco 2.0 137 8.4. Experimentations 140 8.5. Conclusion 142 CONCLUSIONS 143 BIBLIOGRAPHY 147 INDEX 157

Read more less