Parallel Processes and Related Automata / Parallele Prozesse und damit zusammenhängende Automaten


Book Description

The third supplement volume of "Computing" deals with parallel processes and thus with a highly topical area of informatics. As both the first supplement volumes were concerned with numerical questions, the entire subject, the cultivation of which "Computing" purports, is now broadly outlined in the supplement volumes too. The reason for the simultaneous production of so many papers on the same subject was the 60th birthday of Prof. Dr. Wolfgang Handler, an eminent specialist in the field of parallel processing. It was the wish of his friends, colleagues and collaborators that Herr Handler be honoured by the gift of a volume which would have as its centre of interest the area of research that he represents. In this volume, parallelism is focused upon from various angles and an attempt has been made, through new results, to bring it a little further. It is obvious from a glance at the bibliographies of the papers contributed, in which many of Herr Handler's publications are referenced, that he was never far from the writer's minds.




Cellular Automata


Book Description

Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented. Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.




Introduction to Parallel Processing


Book Description

This original text provides comprehensive coverage of parallel algorithms and architectures, beginning with fundamental concepts and continuing through architectural variations and aspects of implementation. Unlike the authors of similar texts, Professor Parhami reviews the circuit model and problemdriven parallel machines, variants of mesh architectures, and composite and hierarchical systems, among other subjects. With its balanced treatment of theory and practical designs, classtested lecture material and problems, and helpful case studies, the book is suited to graduate and upperlevel undergraduate students of advanced architecture or parallel processing.




Automata and Complexity


Book Description

This book commemorates Eric Goles’s achievements in science and engineering. Eric Goles is one of the world leaders in the field of automata and complexity. His groundbreaking discoveries are in the theory and analysis of complex systems, particularly in the field of discrete systems dynamics such as neural networks, automata networks, majority networks, bootstrap percolation models, cellular automata, computational complexity theory, discrete mathematics, and theoretical computer science. Topics include cellular automata, complex networks, models of computation, expansive systems, sandpile automata, Penrose tilings, Boolean automata, models of infection, Fibonacci trees, dominos, reversible automata, and fungal automata. The chapters are authored by world leaders in computer science, physics, mathematics, and engineering. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computer scientists, and engineers to chemists and biologists.




Advances in Artificial Systems for Medicine and Education


Book Description

This book presents an overview of the latest artificial intelligence systems and methods, which have a broad spectrum of effective and sometimes unexpected applications in medical, educational and other fields of sciences and technology. In digital artificial intelligence systems, scientists endeavor to reproduce the innate intellectual abilities of human and other organisms, and the in-depth study of genetic systems and inherited biological processes can provide new approaches to create more and more effective artificial intelligence methods. The book focuses on the intensive development of bio-mathematical studies on living organism patents, which ensure the noise immunity of genetic information, its quasi-holographic features, and its connection with the Boolean algebra of logic used in technical artificial intelligence systems. In other words, the study of genetic systems and creation of methods of artificial intelligence go hand in hand, mutually enriching enrich each other. These proceedings comprise refereed papers presented at the 1st International Conference of Artificial Intelligence, Medical Engineering, and Education (AIMEE2017), held at the Mechanical Engineering Institute of the Russian Academy of Sciences, Moscow, Russia on 21–23 August 2017. The topics discussed include advances in thematic mathematics and bio-mathematics; advances in thematica medical approaches; and advances in thematic technological and educational approaches. The book is a compilation of state-of-the-art papers in the field, covering a comprehensive range of subjects that are relevant to business managers and engineering professionals alike. The breadth and depth of these proceedings make them an excellent resource for asset management practitioners, researchers and academics, as well as undergraduate and postgraduate students interested in artificial intelligence and bioinformatics systems as well as their growing applications




Parallel Processing and Applied Mathematics


Book Description

This book constitutes the thoroughly refereed post-proceedings of the 6th International Conference on Parallel Processing and Applied Mathematics, PPAM 2005. The book presents 135 papers organized in topical sections on parallel and distributed architectures, parallel and distributed non-numerical algorithms, performance analysis, prediction and optimization, grid programming, tools and environments for clusters and grids, applications of parallel/distributed/grid computing, evolutionary computing with applications, parallel data mining, parallel numerics, and mathematical and computing methods.




Parallel and Distributed Processing


Book Description

This book constitutes the refereed proceedings of 10 international workshops held in conjunction with the merged 1998 IPPS/SPDP symposia, held in Orlando, Florida, US in March/April 1998. The volume comprises 118 revised full papers presenting cutting-edge research or work in progress. In accordance with the workshops covered, the papers are organized in topical sections on reconfigurable architectures, run-time systems for parallel programming, biologically inspired solutions to parallel processing problems, randomized parallel computing, solving combinatorial optimization problems in parallel, PC based networks of workstations, fault-tolerant parallel and distributed systems, formal methods for parallel programming, embedded HPC systems and applications, and parallel and distributed real-time systems.










Finite Representations of CCS and TCSP Programs by Automata and Petri Nets


Book Description

This work relates different approaches for the modelling of parallel processes. On the one hand there are the so-called "process algebras" or "abstract programming languages" with Milner's Calculus of Communicating Systems (CCS) and the theoretical version of Hoare's Communicating Sequential Processes (CSP) as main representatives. On the other hand there are machine models, i.e. the classical finite state automata (transition systems), for which, however, more discriminating notions of equivalence than equality of languages are used; and secondly, there are differently powerful types of Petri nets, namely safe and general (place/transition) nets respectively, and predicate/transition nets. Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. We consider both, Milner's well-known interleaving semantics, which is based on infinite transition systems, as well as the new distributed semantics introduced by Degano et al., which is based on infinite safe nets. The main part of this work contains three syntax-driven constructions of transition systems, safe nets, and predicate/transition nets respectively. Each of them is accompanied by a proof of consistency. Due to intrinsic limits, which are also investigated here, neither for transition systems and finite nets, nor for general nets does a finite consistent representation of all CCS and TCSP programs exist. However sublanguages which allow finite representations are discerned. On the other hand the construction of predicate/transition nets is possible for all CCS programs in which every choice and every recursive body starts sequentially.