Listing 1 - 10 of 40 | << page >> |
Sort by
|
Choose an application
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.
Choose an application
Truly Concurrent Process Algebra with Localities introduces localities into truly concurrent process algebras. The book explores 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. 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 (?).
Choose an application
Choose an application
Algebraic number theory. --- Number theory --- Parallel processing (Electronic computers) --- Computer multitasking --- Mathematics.
Choose an application
Choose an application
Build solid software with modern and safe concurrency features. Concurrency is one of the hardest problems in computer science. For years, computer scientists and engineers have developed different strategies for dealing with concurrency. However, the original concurrency primitives are complicated and difficult to understand, and even harder to implement. Using the new async/await APIs in Swift, this book will explain how your code can abstract a lot of the complexity with a simpler interface so you never have to deal with concurrency primitives such as semaphores, locks, and threads yourself. This will allow you to write concurrent code that is easier to read, easier to write, and easier to maintain. These new APIs are deeply ingrained into Swift, offering compile-level features that will keep you from writing dangerous concurrent code. You'll start by exploring why concurrency is hard to implement in a traditional system. Explaining the definition of concurrency and what its primitives are will help you understand why they are hard to use correctly. These concepts will become clearer as you work through the sample projects. The book's focus then shifts exclusively to the new APIs, helping you understand how the integration of the system with the language itself makes it easier for you to write concurrent code without overstepping the bounds of the concurrency safe zone. By the end of the book, you'll have a solid foundation for working safely with concurrent code using the new async/await APIs. What You'll Learn Understand concurrency and its traditional problems Work with the new async/await API and all its features, from the basic usage and await keywords, to task groups and async sequences. Implement modern and safe concurrent code that you can start using right away Who This Book Is For Experienced iOS developers at a semi-senior or senior level. Knowledge on the Grand Central Dispatch is a bonus, but not required.
Computer architecture. Operating systems --- Computer. Automation --- computers --- computerbesturingssystemen --- OS (operating system) --- computerkunde --- Apple --- Swift (Computer program language) --- Application program interfaces (Computer software) --- Application software --- Computer multitasking. --- Development.
Choose an application
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
Choose an application
Computer multitasking. --- Petri nets. --- Graph theory --- Nets (Mathematics) --- Computer multi-tasking --- Concurrent processing (Computer science) --- Multi-tasking, Computer --- Multitasking (Computer science) --- Electronic data processing --- Xarxes de Petri --- Programació multitasca (Informàtica)
Choose an application
This book presents novel approaches to the formal specification of concurrent and parallel systems, mathematical models for describing such systems, and programming and verification concepts for their implementation. A special emphasis is on methods based on artificial intelligence and machine learning techniques. Chapters are revised selected papers from the 29th International Workshop on Concurrency, Specification, and Programming (CS&P 2021), Berlin, Germany. Nine independent chapters cover formal approaches to topics such as requirements formalization, parsing, or granular computing, as well as their applications in recommender systems, decision making, security, optimization, and other areas. The book thus addresses both researchers and practitioners in its field.
Computational intelligence. --- Engineering—Data processing. --- Computational Intelligence. --- Data Engineering. --- Intelligence, Computational --- Artificial intelligence --- Soft computing --- Computer programming --- Computer multitasking. --- Computer multi-tasking --- Concurrent processing (Computer science) --- Multi-tasking, Computer --- Multitasking (Computer science) --- Electronic data processing
Choose an application
This volume contains the papers presented at CONCUR 2005, the 16th International Conference on Concurrency Theory. The purpose of the CONCUR series of conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency and to promote its applications. This year’s conference was in San Francisco, California, from August 23 to August 26. We received 100 submissions in response to a call for papers. Each submission was assigned to at least three members of the Program Committee; in many cases, reviews were solicited from outside experts. The Program Committee discussed the submissions electronically, judging them on their perceived importance, originality, clarity, and appropriateness to the expected audience. The Program Committee selected 38 papers for presentation. Because of the format of the conference and the high number of submissions, many good papers could not be included. Although submissions were read and evaluated, the papers that appear in this volume may differ in form and contents from the corresponding submissions. It is expected that many of the papers will be further revised and submitted to refereed archival journals for publication.
Computer systems. --- Computer science. --- Compilers (Computer programs). --- Computer programming. --- Computer System Implementation. --- Theory of Computation. --- Computer Science Logic and Foundations of Programming. --- Compilers and Interpreters. --- Programming Techniques. --- Parallel processing (Electronic computers) --- Computer multitasking
Listing 1 - 10 of 40 | << page >> |
Sort by
|