Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Computer multitasking --- Algebra. --- Mathematics.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Writing safe and correct parallel programs is tough. Reasoning about concurrent memory modification is tough; efficiently exploiting the modern computing environment (with its multi-layered caches and deep execution pipelines) is also tough. Most systems programming languages add a further complication: unsafe memory access. The burden on you,.

Application software --- Computer multitasking. --- Programming languages (Electronic computers) --- Development.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Build fault-tolerant, robust, and distributed applications in Scala About This Book Understand and use the concepts of reactive programming to build distributed systems running on multiple nodes. Learn how reactive architecture reduces complexity throughout the development process. Get to grips with functional reactive programming and Reactive Microservices. Who This Book Is For This book is for Scala developers who would like to build fault-tolerant, scalable distributed systems. No knowledge of Reactive programming is required. What You Will Learn Understand the fundamental principles of Reactive and Functional programming Develop applications utilizing features of the Akka framework Explore techniques to integrate Scala, Akka, and Play together Learn about Reactive Streams with real-time use cases Develop Reactive Web Applications with Play, Scala, Akka, and Akka Streams Develop and deploy Reactive microservices using the Lagom framework and ConductR In Detail Reactive programming is a scalable, fast way to build applications, and one that helps us write code that is concise, clear, and readable. It can be used for many purposes such as GUIs, robotics, music, and others, and is central to many concurrent systems. This book will be your guide to getting started with Reactive programming in Scala. You will begin with the fundamental concepts of Reactive programming and gradually move on to working with asynchronous data streams. You will then start building an application using Akka Actors and extend it using the Play framework. You will also learn about reactive stream specifications, event sourcing techniques, and different methods to integrate Akka Streams into the Play Framework. This book will also take you one step forward by showing you the advantages of the Lagom framework while working with reactive microservices. You will also learn to scale applications using multi-node clusters and test, secure, and deploy your microservices to the cloud. By the end of the book, you will have gained the knowledge to build robust and distributed systems with Scala and Akka. Style and approach The book takes a pragmatic approach, showing you how to build a scalable distributed system using Scala and Akka.

Scala (Computer program language) --- Electronic data processing --- Application software --- Computer multitasking. --- Distributed processing. --- Development.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Scala (Computer program language) --- Application software --- Computer multitasking --- Business enterprises --- Development --- Mathematics --- Data processing --- Java virtual machine.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. This book provides a unifying theory of communicating automata and their logical properties. It covers finite automata, asynchronous (cellular) automata and lossy channel systems.

Electronic data processing --- Computer multitasking. --- Distributed processing. --- Computer multi-tasking --- Concurrent processing (Computer science) --- Multi-tasking, Computer --- Multitasking (Computer science) --- Distributed computer systems in electronic data processing --- Distributed computing --- Distributed processing in electronic data processing --- Computer networks