Directed Algebraic Topology and Concurrency PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Directed Algebraic Topology and Concurrency PDF full book. Access full book title Directed Algebraic Topology and Concurrency by Lisbeth Fajstrup. Download full books in PDF and EPUB format.
Author: Lisbeth Fajstrup
Publisher: Springer
ISBN: 3319153986
Category : Computers
Languages : en
Pages : 171
Get Book Here
Book Description
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.
Author: Lisbeth Fajstrup
Publisher: Springer
ISBN: 3319153986
Category : Computers
Languages : en
Pages : 171
Get Book Here
Book Description
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.
Author: Dilsun Kaynar
Publisher: Springer Nature
ISBN: 3031020030
Category : Computers
Languages : en
Pages : 130
Get Book Here
Book Description
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, real-time operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability requirements, which make it important to have methods for systematic design of systems and rigorous analysis of timing-dependent behavior. The TIOA framework also supports description and analysis of timed distributed algorithms -- distributed algorithms whose correctness and performance depend on the relative speeds of processors, accuracy of local clocks, or communication delay bounds. Such algorithms arise, for example, in traditional and wireless communications, networks of mobile devices, and shared-memory multiprocessors. The need to prove rigorous theoretical results about timed distributed algorithms makes it important to have a suitable mathematical foundation. An important feature of the TIOA framework is its support for decomposing timed system descriptions. In particular, the framework includes a notion of external behavior for a timed I/O automaton, which captures its discrete interactions with its environment. The framework also defines what it means for one TIOA to implement another, based on an inclusion relationship between their external behavior sets, and defines notions of simulations, which provide sufficient conditions for demonstrating implementation relationships. The framework includes a composition operation for TIOAs, which respects external behavior, and a notion of receptiveness, which implies that a TIOA does not block the passage of time. The TIOA framework also defines the notion of a property and what it means for a property to be a safety or a liveness property. It includes results that capture common proof methods for showing that automata satisfy properties. Table of Contents: Introduction / Mathematical Preliminaries / Describing Timed System Behavior / Timed Automata / Operations on Timed Automata / Properties for Timed Automata / Timed I/O Automata / Operations on Timed I/O Automata / Conclusions and Future Work
Author: Luca Aceto
Publisher: Springer
ISBN: 3540330461
Category : Computers
Languages : en
Pages : 459
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006, held in Vienna, Austria in March 2006 as part of ETAPS. The 28 revised full papers presented together with one invited paper were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections.
Author: Maribel Fernández
Publisher: Springer Nature
ISBN: 3030684466
Category : Computers
Languages : en
Pages : 345
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 30th International Conference on Logic-Based Program Synthesis and Transformation, LOPSTR 2020, which was held during September 7-9, 2020. The 15 papers presented in this volume were carefully reviewed and selected from a total of 31 submissions. The book also contains two invited talks in full paper length. The contributions were organized in topical sections named: rewriting; unification; types; verification; model checking and probabilistic programming; program analysis and testing; and logics.
Author: Bernd Finkbeiner
Publisher: Springer Nature
ISBN: 3031572564
Category :
Languages : en
Pages : 439
Get Book Here
Book Description
Author: Holger Hermanns
Publisher: Springer Science & Business Media
ISBN: 3540330569
Category : Computers
Languages : en
Pages : 519
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2005, held Austria in March/April 2006 as part of ETAPS. The 30 revised full research papers and four revised tool demonstration papers presented together with one invited paper were carefully reviewed and selected from a total of 118 submissions. The papers are organized in topical sections.
Author: Javier Esparza
Publisher: Springer
ISBN: 366254458X
Category : Computers
Languages : en
Pages : 571
Get Book Here
Book Description
This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.
Author: Stefan Kiefer
Publisher: Springer Nature
ISBN: 3030719952
Category : Mathematics
Languages : en
Pages : 574
Get Book Here
Book Description
This open access book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 28 regular papers presented in this volume were carefully reviewed and selected from 88 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
Author: Evgeniĭ Aleksandrovich Asarin
Publisher: Springer Science & Business Media
ISBN: 3540450262
Category : Computers
Languages : en
Pages : 378
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 4th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2006. The book presents 22 revised full papers presented together with 3 invited talks. Coverage includes work on foundations and semantics of timed systems including timed automata, timed Petri nets, timed MSCs, hybrid automata, timed process algebra, timed temporal logics, timed abstract state machines, as well as probabilistic models.
Author: Mohr, Martin
Publisher: KIT Scientific Publishing
ISBN: 3731512750
Category :
Languages : en
Pages : 464
Get Book Here
Book Description
I report on applications of slicing and program dependence graphs (PDGs) to software security. Moreover, I propose a framework that generalizes both data-flow analysis on control-flow graphs and slicing on PDGs. This framework can be used to systematically derive data-flow-like analyses on PDGs that go beyond slicing. I demonstrate that data-flow analysis can be systematically applied to PDGs and show the practicability of my approach.
