Download or read book Directed Algebraic Topology and Concurrency written by Lisbeth Fajstrup and published by Springer. This book was released on 2016-03-02 with total page 171 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph presents an application of concepts and methods from algebraic topology to models of concurrent processes in computer science and their analysis. Taking well-known discrete models for concurrent processes in resource management as a point of departure, the book goes on to refine combinatorial and topological models. In the process, it develops tools and invariants for the new discipline directed algebraic topology, which is driven by fundamental research interests as well as by applications, primarily in the static analysis of concurrent programs. The state space of a concurrent program is described as a higher-dimensional space, the topology of which encodes the essential properties of the system. In order to analyse all possible executions in the state space, more than “just” the topological properties have to be considered: Execution paths need to respect a partial order given by the time flow. As a result, tools and concepts from topology have to be extended to take privileged directions into account. The target audience for this book consists of graduate students, researchers and practitioners in the field, mathematicians and computer scientists alike.
Download or read book Directed Algebraic Topology written by Marco Grandis and published by Cambridge University Press. This book was released on 2009-09-17 with total page 444 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is the first authored book to be dedicated to the new field of directed algebraic topology that arose in the 1990s, in homotopy theory and in the theory of concurrent processes. Its general aim can be stated as 'modelling non-reversible phenomena' and its domain should be distinguished from that of classical algebraic topology by the principle that directed spaces have privileged directions and directed paths therein need not be reversible. Its homotopical tools (corresponding in the classical case to ordinary homotopies, fundamental group and fundamental groupoid) should be similarly 'non-reversible': directed homotopies, fundamental monoid and fundamental category. Homotopy constructions occur here in a directed version, which gives rise to new 'shapes', like directed cones and directed spheres. Applications will deal with domains where privileged directions appear, including rewrite systems, traffic networks and biological systems. The most developed examples can be found in the area of concurrency.
Download or read book Contributions to Directed Algebraic Topology written by Martin Raussen and published by . This book was released on 2014 with total page 63 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Directed Algebraic Topology written by Marco Grandis and published by Cambridge University Press. This book was released on 2009-09-17 with total page 445 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is the first authored book to be dedicated to the new field of directed algebraic topology that arose in the 1990s, in homotopy theory and in the theory of concurrent processes. Its general aim can be stated as 'modelling non-reversible phenomena' and its domain should be distinguished from that of classical algebraic topology by the principle that directed spaces have privileged directions and directed paths therein need not be reversible. Its homotopical tools (corresponding in the classical case to ordinary homotopies, fundamental group and fundamental groupoid) should be similarly 'non-reversible': directed homotopies, fundamental monoid and fundamental category. Homotopy constructions occur here in a directed version, which gives rise to new 'shapes', like directed cones and directed spheres. Applications will deal with domains where privileged directions appear, including rewrite systems, traffic networks and biological systems. The most developed examples can be found in the area of concurrency.
Download or read book Research in Computational Topology 2 written by Ellen Gasparovic and published by Springer Nature. This book was released on 2022-05-10 with total page 304 pages. Available in PDF, EPUB and Kindle. Book excerpt: This second volume of Research in Computational Topology is a celebration and promotion of research by women in applied and computational topology, containing the proceedings of the second workshop for Women in Computational Topology (WinCompTop) as well as papers solicited from the broader WinCompTop community. The multidisciplinary and international WinCompTop workshop provided an exciting and unique opportunity for women in diverse locations and research specializations to interact extensively and collectively contribute to new and active research directions in the field. The prestigious senior researchers that signed on to head projects at the workshop are global leaders in the discipline, and two of them were authors on some of the first papers in the field. Some of the featured topics include topological data analysis of power law structure in neural data; a nerve theorem for directional graph covers; topological or homotopical invariants for directed graphs encoding connections among a network of neurons; and the issue of approximation of objects by digital grids, including precise relations between the persistent homology of dual cubical complexes.
Download or read book Algebraic Topology and Concurrency written by Lisbeth Fajstrup and published by . This book was released on 1999 with total page 47 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Advances in Mathematical Sciences written by Bahar Acu and published by Springer Nature. This book was released on 2020-07-16 with total page 364 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume highlights the mathematical research presented at the 2019 Association for Women in Mathematics (AWM) Research Symposium held at Rice University, April 6-7, 2019. The symposium showcased research from women across the mathematical sciences working in academia, government, and industry, as well as featured women across the career spectrum: undergraduates, graduate students, postdocs, and professionals. The book is divided into eight parts, opening with a plenary talk and followed by a combination of research paper contributions and survey papers in the different areas of mathematics represented at the symposium: algebraic combinatorics and graph theory algebraic biology commutative algebra analysis, probability, and PDEs topology applied mathematics mathematics education
Download or read book A Journey Through Discrete Mathematics written by Martin Loebl and published by Springer. This book was released on 2017-10-11 with total page 829 pages. Available in PDF, EPUB and Kindle. Book excerpt: This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiří Matoušek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition – something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Jiří Matoušek’s numerous areas of mathematical interest.
Download or read book Relational and Algebraic Methods in Computer Science written by Uli Fahrenberg and published by Springer Nature. This book was released on with total page 272 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Theories of Programming written by Cliff B. Jones and published by Morgan & Claypool. This book was released on 2021-09-26 with total page 450 pages. Available in PDF, EPUB and Kindle. Book excerpt: Sir Tony Hoare has had an enormous influence on computer science, from the Quicksort algorithm to the science of software development, concurrency and program verification. His contributions have been widely recognised: He was awarded the ACM’s Turing Award in 1980, the Kyoto Prize from the Inamori Foundation in 2000, and was knighted for “services to education and computer science” by Queen Elizabeth II of England in 2000. This book presents the essence of his various works—the quest for effective abstractions—both in his own words as well as chapters written by leading experts in the field, including many of his research collaborators. In addition, this volume contains biographical material, his Turing award lecture, the transcript of an interview and some of his seminal papers. Hoare’s foundational paper “An Axiomatic Basis for Computer Programming”, presented his approach, commonly known as Hoare Logic, for proving the correctness of programs by using logical assertions. Hoare Logic and subsequent developments have formed the basis of a wide variety of software verification efforts. Hoare was instrumental in proposing the Verified Software Initiative, a cooperative international project directed at the scientific challenges of large-scale software verification, encompassing theories, tools and experiments. Tony Hoare’s contributions to the theory and practice of concurrent software systems are equally impressive. The process algebra called Communicating Sequential Processes (CSP) has been one of the fundamental paradigms, both as a mathematical theory to reason about concurrent computation as well as the basis for the programming language occam. CSP served as a framework for exploring several ideas in denotational semantics such as powerdomains, as well as notions of abstraction and refinement. It is the basis for a series of industrial-strength tools which have been employed in a wide range of applications. This book also presents Hoare’s work in the last few decades. These works include a rigorous approach to specifications in software engineering practice, including procedural and data abstractions, data refinement, and a modular theory of designs. More recently, he has worked with collaborators to develop Unifying Theories of Programming (UTP). Their goal is to identify the common algebraic theories that lie at the core of sequential, concurrent, reactive and cyber-physical computations.
Download or read book Automata Languages and Programming written by Magnús M. Halldórsson and published by Springer. This book was released on 2015-06-19 with total page 751 pages. Available in PDF, EPUB and Kindle. Book excerpt: The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata and theory of programming; and foundations of networked computation: models, algorithms and information management.
Download or read book Mathematics in Cyber Research written by Paul L. Goethals and published by CRC Press. This book was released on 2022-02-06 with total page 524 pages. Available in PDF, EPUB and Kindle. Book excerpt: In the last decade, both scholars and practitioners have sought novel ways to address the problem of cybersecurity. Innovative outcomes have included applications such as blockchain as well as creative methods for cyber forensics, software development, and intrusion prevention. Accompanying these technological advancements, discussion on cyber matters at national and international levels has focused primarily on the topics of law, policy, and strategy. The objective of these efforts is typically to promote security by establishing agreements among stakeholders on regulatory activities. Varying levels of investment in cyberspace, however, comes with varying levels of risk; in some ways, this can translate directly to the degree of emphasis for pushing substantial change. At the very foundation or root of cyberspace systems and processes are tenets and rules governed by principles in mathematics. Topics such as encrypting or decrypting file transmissions, modeling networks, performing data analysis, quantifying uncertainty, measuring risk, and weighing decisions or adversarial courses of action represent a very small subset of activities highlighted by mathematics. To facilitate education and a greater awareness of the role of mathematics in cyber systems and processes, a description of research in this area is needed. Mathematics in Cyber Research aims to familiarize educators and young researchers with the breadth of mathematics in cyber-related research. Each chapter introduces a mathematical sub-field, describes relevant work in this field associated with the cyber domain, provides methods and tools, as well as details cyber research examples or case studies. Features One of the only books to bring together such a diverse and comprehensive range of topics within mathematics and apply them to cyber research. Suitable for college undergraduate students or educators that are either interested in learning about cyber-related mathematics or intend to perform research within the cyber domain. The book may also appeal to practitioners within the commercial or government industry sectors. Most national and international venues for collaboration and discussion on cyber matters have focused primarily on the topics of law, policy, strategy, and technology. This book is among the first to address the underpinning mathematics.
Download or read book Computational Psychiatry written by Rodrick Wallace and published by Springer. This book was released on 2017-04-20 with total page 243 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book explores mental disorders from a uniquely evolutionary perspective. Although there have been many attempts to mathematically model neural processes and, to some extent, their dysfunction, there is very little literature that models mental function within a sociocultural, socioeconomic, and environmental context. Addressing this gap in the extant literature, this book explores essential aspects of mental disorders, recognizing the ubiquitous role played by the exaptation of crosstalk between cognitive modules at many different scales and levels of organization, the missing heritability of complex diseases, and cultural epigenetics. Further, it introduces readers to valuable control theory tools that permit the exploration of the environmental induction of neurodevelopmental disorders, as well as the study of the synergism between culture, psychopathology and sleep disorders, offering a distinctively unique resource.
Download or read book Distributed Computing Through Combinatorial Topology written by Maurice Herlihy and published by Newnes. This book was released on 2013-11-30 with total page 335 pages. Available in PDF, EPUB and Kindle. Book excerpt: Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. - Named a 2013 Notable Computer Book for Computing Methodologies by Computing Reviews - Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understanding - Presents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols - Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises
Download or read book CONCUR 2010 Concurrency Theory written by Paul Gastin and published by Springer. This book was released on 2010-08-21 with total page 613 pages. Available in PDF, EPUB and Kindle. Book excerpt: Annotation This book constitutes the refereed proceedigs of the 20th International Conference on Concurrency Theory, CONCUR 2010, held in Paris, France, August 31 - September 3, 2010. The 35 revised full papers were carefully reviewed and selected from 107 submissions. The topics include:- Basic models of concurrency such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets. - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics. - Models of specialized systems such as biology-inspired systems, circuits, hybrid systems, mobile and collaborative systems, multi-core processors, probabilistic systems, real-time systems, service-oriented computing, and synchronous systems.- Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking and run-time verification.
Download or read book Foundations of Software Science and Computation Structures written by Mikołaj Bojańczyk and published by Springer. This book was released on 2019-04-05 with total page 556 pages. Available in PDF, EPUB and Kindle. Book excerpt: This open access book constitutes the proceedings of the 22nd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2019.The 29 papers presented in this volume were carefully reviewed and selected from 85 submissions. They deal with foundational research with a clear significance for software science.
Download or read book Manifolds And Local Structures A General Theory written by Marco Grandis and published by World Scientific. This book was released on 2021-02-10 with total page 374 pages. Available in PDF, EPUB and Kindle. Book excerpt: Local structures, like differentiable manifolds, fibre bundles, vector bundles and foliations, can be obtained by gluing together a family of suitable 'elementary spaces', by means of partial homeomorphisms that fix the gluing conditions and form a sort of 'intrinsic atlas', instead of the more usual system of charts living in an external framework.An 'intrinsic manifold' is defined here as such an atlas, in a suitable category of elementary spaces: open euclidean spaces, or trivial bundles, or trivial vector bundles, and so on.This uniform approach allows us to move from one basis to another: for instance, the elementary tangent bundle of an open Euclidean space is automatically extended to the tangent bundle of any differentiable manifold. The same holds for tensor calculus.Technically, the goal of this book is to treat these structures as 'symmetric enriched categories' over a suitable basis, generally an ordered category of partial mappings.This approach to gluing structures is related to Ehresmann's one, based on inductive pseudogroups and inductive categories. A second source was the theory of enriched categories and Lawvere's unusual view of interesting mathematical structures as categories enriched over a suitable basis.
