Algebraic Theory for True Concurrency

Algebraic Theory for True Concurrency

Author: Yong Wang

Publisher: Elsevier

Published: 2023-01-03

Total Pages: 230

ISBN-13: 0443189137

DOWNLOAD EBOOK

Algebraic Theory for True Concurrency presents readers with the algebraic laws for true concurrency. Parallelism and concurrency are two of the core concepts within computer science. This book covers the different realms of concurrency, which enables programs, algorithms or problems to be broken out into order-independent or partially ordered components to improve computation and execution speed. There are two primary approaches for executing concurrency: interleaving concurrency and true concurrency. The main representative of interleaving concurrency is bisimulation/rooted branching bisimulation equivalences which is also readily explored. This work eventually founded the comprehensive axiomatization modulo bisimulation equivalence -- ACP (Algebra of Communicating Processes).The other approach to concurrency is true concurrency. Research on true concurrency is active and includes many emerging applications. First, there are several truly concurrent bisimulation equivalences, including: pomset bisimulation equivalence, step bisimulation equivalence, history-preserving (hp-) bisimulation equivalence, and hereditary history-preserving (hhp-) bisimulation equivalence, the most well-known truly concurrent bisimulation equivalence. Introduces algebraic properties and laws for true concurrency, one of the foundational concepts of computer science Presents all aspects of algebraic true concurrency, including the basis of semantics, calculi for true concurrency and for axiomatization Integrates all aspects of algebraic theory for true concurrency, along with extensions and applications


Book Synopsis Algebraic Theory for True Concurrency by : Yong Wang

Download or read book Algebraic Theory for True Concurrency written by Yong Wang and published by Elsevier. This book was released on 2023-01-03 with total page 230 pages. Available in PDF, EPUB and Kindle. Book excerpt: Algebraic Theory for True Concurrency presents readers with the algebraic laws for true concurrency. Parallelism and concurrency are two of the core concepts within computer science. This book covers the different realms of concurrency, which enables programs, algorithms or problems to be broken out into order-independent or partially ordered components to improve computation and execution speed. There are two primary approaches for executing concurrency: interleaving concurrency and true concurrency. The main representative of interleaving concurrency is bisimulation/rooted branching bisimulation equivalences which is also readily explored. This work eventually founded the comprehensive axiomatization modulo bisimulation equivalence -- ACP (Algebra of Communicating Processes).The other approach to concurrency is true concurrency. Research on true concurrency is active and includes many emerging applications. First, there are several truly concurrent bisimulation equivalences, including: pomset bisimulation equivalence, step bisimulation equivalence, history-preserving (hp-) bisimulation equivalence, and hereditary history-preserving (hhp-) bisimulation equivalence, the most well-known truly concurrent bisimulation equivalence. Introduces algebraic properties and laws for true concurrency, one of the foundational concepts of computer science Presents all aspects of algebraic true concurrency, including the basis of semantics, calculi for true concurrency and for axiomatization Integrates all aspects of algebraic theory for true concurrency, along with extensions and applications

Handbook of Truly Concurrent Process Algebra

Handbook of Truly Concurrent Process Algebra

Author: Yong Wang

Publisher: Elsevier

Published: 2023-12-15

Total Pages: 648

ISBN-13: 0443215162

DOWNLOAD EBOOK

Handbook of Truly Concurrent Process Algebra provides readers with a detailed and in-depth explanation of the algebra used for concurrent computing. This complete handbook is divided into five Parts: Algebraic Theory for Reversible Computing, Probabilistic Process Algebra for True Concurrency, Actors – A Process Algebra-Based Approach, Secure Process Algebra, and Verification of Patterns. The author demonstrates actor models which are captured using the following characteristics: Concurrency, Asynchrony, Uniqueness, Concentration, Communication Dependency, Abstraction, and Persistence. Truly concurrent process algebras are generalizations of the corresponding traditional process algebras. Handbook of Truly Concurrent Process Algebra introduces several advanced extensions and applications of truly concurrent process algebras. Part 1: Algebraic Theory for Reversible Computing provides readers with all aspects of algebraic theory for reversible computing, including the basis of semantics, calculi for reversible computing, and axiomatization for reversible computing. Part 2: Probabilistic Process Algebra for True Concurrency provides readers with all aspects of probabilistic process algebra for true concurrency, including the basis of semantics, calculi for probabilistic computing, axiomatization for probabilistic computing, as well as mobile calculi for probabilistic computing. Part 3: Actors - A Process Algebra-Based Approach bridges the two concurrent models, process algebra and actors, by capturing the actor model in the following characteristics: Concurrency, Asynchrony, Uniqueness, Concentration, Communication Dependency, Abstraction, and Persistence. Part 4: Secure Process Algebra demonstrates the advantages of process algebra in verifying security protocols – it has a firmly theoretic foundation and rich expressive powers to describe security protocols. Part 5: Verification of Patterns formalizes software patterns according to the categories of the patterns and verifies the correctness of patterns based on truly concurrent process algebra. Every pattern is detailed according to a regular format to be understood and utilized easily, which includes introduction to a pattern and its verifications. Patterns of the vertical domains are also provided, including the domains of networked objects and resource management. To help readers develop and implement the software patterns scientifically, the pattern languages are also presented. Presents all aspects of full algebraic reversible computing, including the basis of semantics, calculi for full reversible computing, and axiomatization for full reversible computing Introduces algebraic properties and laws for probabilistic computing, one of the foundational concepts of Computer Science Presents the calculi for probabilistic computing, including the basis of semantics and calculi for reversible computing


Book Synopsis Handbook of Truly Concurrent Process Algebra by : Yong Wang

Download or read book Handbook of Truly Concurrent Process Algebra written by Yong Wang and published by Elsevier. This book was released on 2023-12-15 with total page 648 pages. Available in PDF, EPUB and Kindle. Book excerpt: Handbook of Truly Concurrent Process Algebra provides readers with a detailed and in-depth explanation of the algebra used for concurrent computing. This complete handbook is divided into five Parts: Algebraic Theory for Reversible Computing, Probabilistic Process Algebra for True Concurrency, Actors – A Process Algebra-Based Approach, Secure Process Algebra, and Verification of Patterns. The author demonstrates actor models which are captured using the following characteristics: Concurrency, Asynchrony, Uniqueness, Concentration, Communication Dependency, Abstraction, and Persistence. Truly concurrent process algebras are generalizations of the corresponding traditional process algebras. Handbook of Truly Concurrent Process Algebra introduces several advanced extensions and applications of truly concurrent process algebras. Part 1: Algebraic Theory for Reversible Computing provides readers with all aspects of algebraic theory for reversible computing, including the basis of semantics, calculi for reversible computing, and axiomatization for reversible computing. Part 2: Probabilistic Process Algebra for True Concurrency provides readers with all aspects of probabilistic process algebra for true concurrency, including the basis of semantics, calculi for probabilistic computing, axiomatization for probabilistic computing, as well as mobile calculi for probabilistic computing. Part 3: Actors - A Process Algebra-Based Approach bridges the two concurrent models, process algebra and actors, by capturing the actor model in the following characteristics: Concurrency, Asynchrony, Uniqueness, Concentration, Communication Dependency, Abstraction, and Persistence. Part 4: Secure Process Algebra demonstrates the advantages of process algebra in verifying security protocols – it has a firmly theoretic foundation and rich expressive powers to describe security protocols. Part 5: Verification of Patterns formalizes software patterns according to the categories of the patterns and verifies the correctness of patterns based on truly concurrent process algebra. Every pattern is detailed according to a regular format to be understood and utilized easily, which includes introduction to a pattern and its verifications. Patterns of the vertical domains are also provided, including the domains of networked objects and resource management. To help readers develop and implement the software patterns scientifically, the pattern languages are also presented. Presents all aspects of full algebraic reversible computing, including the basis of semantics, calculi for full reversible computing, and axiomatization for full reversible computing Introduces algebraic properties and laws for probabilistic computing, one of the foundational concepts of Computer Science Presents the calculi for probabilistic computing, including the basis of semantics and calculi for reversible computing

Observing "true" Concurrency

Observing

Author: Lalita A. Jategaonkar

Publisher:

Published: 1993

Total Pages: 154

ISBN-13:

DOWNLOAD EBOOK

Abstract: "In concurrent process theory, processes are often modeled by state machines and Petri Nets. Algebraic process theories based on state machines, exemplified by Milner's CCS and Hoare's CSP, have been more fully developed than Net-based theories, but are inadequate for modeling 'true' concurrency concepts such as non-atomic actions, action refinement, locality of actions, and multithreadedness. We introduce an action refinement operator and present some 'fully abstract' semantics for 'true' concurrency. We show that these semantics are decidable for finite- state concurrent processes and characterize their computational complexity."


Book Synopsis Observing "true" Concurrency by : Lalita A. Jategaonkar

Download or read book Observing "true" Concurrency written by Lalita A. Jategaonkar and published by . This book was released on 1993 with total page 154 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "In concurrent process theory, processes are often modeled by state machines and Petri Nets. Algebraic process theories based on state machines, exemplified by Milner's CCS and Hoare's CSP, have been more fully developed than Net-based theories, but are inadequate for modeling 'true' concurrency concepts such as non-atomic actions, action refinement, locality of actions, and multithreadedness. We introduce an action refinement operator and present some 'fully abstract' semantics for 'true' concurrency. We show that these semantics are decidable for finite- state concurrent processes and characterize their computational complexity."

CONCUR'99. Concurrency Theory

CONCUR'99. Concurrency Theory

Author: Jos C.M. Baeten

Publisher: Springer

Published: 2003-07-31

Total Pages: 585

ISBN-13: 3540483209

DOWNLOAD EBOOK

This book constitutes the proceedings of the 10th International Conference on Concurrency Theory, CONCUR'99, held in Eindhoven, The Netherlands in August 1999. The 32 revised full papers presented together with four invited contributions were selected from a total of 91 submissions. The papers address all areas of semantics, logics, and verification techniques for concurrent systems, in particular process algebras, Petri nets, event-structures, real-time systems, hybrid systems, stochastic systems, decidability, model-checking, verification, refinement, term and graph rewriting, distributed programming, logic constraint programming, typing systems, etc.


Book Synopsis CONCUR'99. Concurrency Theory by : Jos C.M. Baeten

Download or read book CONCUR'99. Concurrency Theory written by Jos C.M. Baeten and published by Springer. This book was released on 2003-07-31 with total page 585 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 10th International Conference on Concurrency Theory, CONCUR'99, held in Eindhoven, The Netherlands in August 1999. The 32 revised full papers presented together with four invited contributions were selected from a total of 91 submissions. The papers address all areas of semantics, logics, and verification techniques for concurrent systems, in particular process algebras, Petri nets, event-structures, real-time systems, hybrid systems, stochastic systems, decidability, model-checking, verification, refinement, term and graph rewriting, distributed programming, logic constraint programming, typing systems, etc.

Concurrency and Nets

Concurrency and Nets

Author: Klaus Voss

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 616

ISBN-13: 3642728227

DOWNLOAD EBOOK

Concurrency and Nets is a special volume in the series "Advances in Petri Nets". Prepared as a tribute to Carl Adam Petri on the occasion of his 60th birthday, it is devoted to an outstanding personality and his pioneering and fruitful scientific work. Part I (70 pages of over 600) presents the congratulatory addresses and invited talks that were given at an Anniversary Colloquium. The contributions of this part honor Carl Adam Petri and his work from many different perspectives. Part II is a collection of invited papers discussing various aspects of the theme Concurrency and Nets. These papers are contributed partly by researchers that were or are still associated with the Petri Institute at GMD and partly by researchers whose scientific work deals with Net Theory or related system models. The topics range from basic theoretical aspects to application oriented methods.


Book Synopsis Concurrency and Nets by : Klaus Voss

Download or read book Concurrency and Nets written by Klaus Voss and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 616 pages. Available in PDF, EPUB and Kindle. Book excerpt: Concurrency and Nets is a special volume in the series "Advances in Petri Nets". Prepared as a tribute to Carl Adam Petri on the occasion of his 60th birthday, it is devoted to an outstanding personality and his pioneering and fruitful scientific work. Part I (70 pages of over 600) presents the congratulatory addresses and invited talks that were given at an Anniversary Colloquium. The contributions of this part honor Carl Adam Petri and his work from many different perspectives. Part II is a collection of invited papers discussing various aspects of the theme Concurrency and Nets. These papers are contributed partly by researchers that were or are still associated with the Petri Institute at GMD and partly by researchers whose scientific work deals with Net Theory or related system models. The topics range from basic theoretical aspects to application oriented methods.

Truly Concurrent Process Algebra With Localities

Truly Concurrent Process Algebra With Localities

Author: Yong Wang

Publisher: Elsevier

Published: 2024-11-01

Total Pages: 0

ISBN-13: 0443330697

DOWNLOAD EBOOK

Truly Concurrent Process Algebra with Localities introduces localities into truly concurrent process algebras. Traditional parallelism often existed in distributed computing, as distributed systems are usually autonomous and local computers have been single-core, single-processor, and timed (timed computing is serial in nature). Today, due to the progress of hardware, multi-cores, multi-processors, and GPUs are now making the local computer truly parallel. Concurrent computing is an important means of addressing complexity in structuring software systems, with huge impacts in many areas of computing, including increased program throughput, high responsiveness to input and output, and program structure that is more appropriate to certain tasks. Distribution is an important aspect of concurrent systems and reflects in their semantics. The distributed semantics gives a measure of the degree of parallelism in concurrent systems and keeps track of the local semantics of components within the concurrent system. Static localities say that processes are equated if they are at the same location and have the same behaviors at each location, while dynamic localities say that locations are associated with actions rather than parallel components. The well-known process algebras, such as CCS, ACP and ? -calculus, capture the interleaving concurrency based on bisimilarity semantics. In this book, readers will be able to explore all aspects of localities in truly concurrent process algebras, such as Calculus for True Concurrency (CTC), which is a generalization of CCS for true concurrency, Algebra of Parallelism for True Concurrency (APTC), which is a generalization of ACP for true concurrency and ? Calculus for True Concurrency (?). Together, these approaches capture the so-called true concurrency based on truly concurrent bisimilarities, such as pomset bisimilarity, step bisimilarity, history-preserving (hp-) bisimilarity and hereditary history-preserving (hhp-) bisimilarity. Truly concurrent process algebras are generalizations of the corresponding traditional process algebras. This book provides readers with all aspects of algebraic theory for localities, including the basis of semantics, calculi for static localities, axiomatization for static localities, as well as calculi for dynamic localities, and axiomatization for dynamic localities. Introduces algebraic properties and laws for localities, one of the important concepts of software engineering for concurrent computing systems Discusses algebraic theory for static localities and dynamic localities, including the basis of semantics, calculi, and axiomatization Presents all aspects of localities in truly concurrent process algebras, including Calculus for True Concurrency (CTC), Algebra of Parallelism for True Concurrency (APTC), and Process Calculus for True Concurrency (?)


Book Synopsis Truly Concurrent Process Algebra With Localities by : Yong Wang

Download or read book Truly Concurrent Process Algebra With Localities written by Yong Wang and published by Elsevier. This book was released on 2024-11-01 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: Truly Concurrent Process Algebra with Localities introduces localities into truly concurrent process algebras. Traditional parallelism often existed in distributed computing, as distributed systems are usually autonomous and local computers have been single-core, single-processor, and timed (timed computing is serial in nature). Today, due to the progress of hardware, multi-cores, multi-processors, and GPUs are now making the local computer truly parallel. Concurrent computing is an important means of addressing complexity in structuring software systems, with huge impacts in many areas of computing, including increased program throughput, high responsiveness to input and output, and program structure that is more appropriate to certain tasks. Distribution is an important aspect of concurrent systems and reflects in their semantics. The distributed semantics gives a measure of the degree of parallelism in concurrent systems and keeps track of the local semantics of components within the concurrent system. Static localities say that processes are equated if they are at the same location and have the same behaviors at each location, while dynamic localities say that locations are associated with actions rather than parallel components. The well-known process algebras, such as CCS, ACP and ? -calculus, capture the interleaving concurrency based on bisimilarity semantics. In this book, readers will be able to explore all aspects of localities in truly concurrent process algebras, such as Calculus for True Concurrency (CTC), which is a generalization of CCS for true concurrency, Algebra of Parallelism for True Concurrency (APTC), which is a generalization of ACP for true concurrency and ? Calculus for True Concurrency (?). Together, these approaches capture the so-called true concurrency based on truly concurrent bisimilarities, such as pomset bisimilarity, step bisimilarity, history-preserving (hp-) bisimilarity and hereditary history-preserving (hhp-) bisimilarity. Truly concurrent process algebras are generalizations of the corresponding traditional process algebras. This book provides readers with all aspects of algebraic theory for localities, including the basis of semantics, calculi for static localities, axiomatization for static localities, as well as calculi for dynamic localities, and axiomatization for dynamic localities. Introduces algebraic properties and laws for localities, one of the important concepts of software engineering for concurrent computing systems Discusses algebraic theory for static localities and dynamic localities, including the basis of semantics, calculi, and axiomatization Presents all aspects of localities in truly concurrent process algebras, including Calculus for True Concurrency (CTC), Algebra of Parallelism for True Concurrency (APTC), and Process Calculus for True Concurrency (?)

Communicating Process Architectures 2005

Communicating Process Architectures 2005

Author: J.F. Broenink

Publisher: IOS Press

Published: 2005-09-09

Total Pages: 416

ISBN-13: 1607501449

DOWNLOAD EBOOK

The awareness of the ideas characterized by Communicating Processes Architecture and their adoption by industry beyond their traditional base in safety-critical systems and security is growing. The complexity of modern computing systems has become so great that no one person – maybe not even a small team – can understand all aspects and all interactions. The only hope of making such systems work is to ensure that all components are correct by design and that the components can be combined to achieve scalability. A crucial property is that the cost of making a change to a system depends linearly on the size of that change – not on the size of the system being changed. Of course, this must be true whether that change is a matter of maintenance (e.g. to take advantage of upcoming multiprocessor hardware) or the addition of new functionality. One key is that system composition (and disassembly) introduces no surprises. A component must behave consistently, no matter the context in which it is used – which means that component interfaces must be explicit, published and free from hidden side-effect. This publication offers strongly refereed high-quality papers covering many differing aspects: system design and implementation (for both hardware and software), tools (concurrent programming languages, libraries and run-time kernels), formal methods and applications.


Book Synopsis Communicating Process Architectures 2005 by : J.F. Broenink

Download or read book Communicating Process Architectures 2005 written by J.F. Broenink and published by IOS Press. This book was released on 2005-09-09 with total page 416 pages. Available in PDF, EPUB and Kindle. Book excerpt: The awareness of the ideas characterized by Communicating Processes Architecture and their adoption by industry beyond their traditional base in safety-critical systems and security is growing. The complexity of modern computing systems has become so great that no one person – maybe not even a small team – can understand all aspects and all interactions. The only hope of making such systems work is to ensure that all components are correct by design and that the components can be combined to achieve scalability. A crucial property is that the cost of making a change to a system depends linearly on the size of that change – not on the size of the system being changed. Of course, this must be true whether that change is a matter of maintenance (e.g. to take advantage of upcoming multiprocessor hardware) or the addition of new functionality. One key is that system composition (and disassembly) introduces no surprises. A component must behave consistently, no matter the context in which it is used – which means that component interfaces must be explicit, published and free from hidden side-effect. This publication offers strongly refereed high-quality papers covering many differing aspects: system design and implementation (for both hardware and software), tools (concurrent programming languages, libraries and run-time kernels), formal methods and applications.

Software Engineering

Software Engineering

Author: Krzysztof Zieliński

Publisher: IOS Press

Published: 2005

Total Pages: 1316

ISBN-13: 1586035592

DOWNLOAD EBOOK

The capability to design quality software and implement modern information systems is at the core of economic growth in the 21st century. This book aims to review and analyze software engineering technologies, focusing on the evolution of design and implementation platforms as well as on novel computer systems.


Book Synopsis Software Engineering by : Krzysztof Zieliński

Download or read book Software Engineering written by Krzysztof Zieliński and published by IOS Press. This book was released on 2005 with total page 1316 pages. Available in PDF, EPUB and Kindle. Book excerpt: The capability to design quality software and implement modern information systems is at the core of economic growth in the 21st century. This book aims to review and analyze software engineering technologies, focusing on the evolution of design and implementation platforms as well as on novel computer systems.

CONCUR '96: Concurrency Theory

CONCUR '96: Concurrency Theory

Author: Ugo Montanari

Publisher: Springer Science & Business Media

Published: 1996-08-07

Total Pages: 772

ISBN-13: 9783540616047

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97. held in Warsaw, Poland, in July 1997. The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.


Book Synopsis CONCUR '96: Concurrency Theory by : Ugo Montanari

Download or read book CONCUR '96: Concurrency Theory written by Ugo Montanari and published by Springer Science & Business Media. This book was released on 1996-08-07 with total page 772 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97. held in Warsaw, Poland, in July 1997. The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.

Directed Algebraic Topology and Concurrency

Directed Algebraic Topology and Concurrency

Author: Lisbeth Fajstrup

Publisher: Springer

Published: 2016-03-02

Total Pages: 171

ISBN-13: 3319153986

DOWNLOAD EBOOK

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.


Book Synopsis Directed Algebraic Topology and Concurrency by : Lisbeth Fajstrup

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.