Listing 1 - 10 of 34 | << 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
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,.
Choose an application
Algebraic number theory. --- Number theory --- Parallel processing (Electronic computers) --- Computer multitasking --- Mathematics.
Choose an application
Choose an application
Scala (Computer program language) --- Application software --- Computer multitasking --- Business enterprises --- Development --- Mathematics --- Data processing --- Java virtual machine.
Choose an application
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
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
Transactions on Petri Nets and Other Models of Concurrency (ToPNoC) XVII. These Transactions publish archival papers in the broad area of Petri nets and other models of concurrency, ranging from theoretical work to tool support and industrial applications. ToPNoC issues are published as LNCS volumes, and hence are widely distributed and indexed. This Journal has its own Editorial Board which selects papers based on a rigorous two-stage refereeing process. ToPNoC contains: – Revised versions of a selection of the best papers from workshops and tutorials at the annual Petri net conferences – Special sections/issues within particular subareas (similar to those published in the Advances in Petri Nets series) – Other papers invited for publication in ToPNoC – Papers submitted directly to ToPNoC by their authors The 17th volume of ToPNoC contains revised and extended versions of a selection of the best workshop and tutorial papers presented at the 43rd International Conference on Application and Theory of Petri Nets and Concurrency, Petri Nets 2022. The papers cover a diverse range of topics including model checking and system verification, refinement and synthesis, foundational work on specific classes of Petri nets, and innovative applications of Petri nets and other models of concurrency. Application areas covered in this volume are: process mining, verification, formal semantics, distributed simulations, business processes, distributed systems, and net synthesis. Thus, this volume gives a good overview of ongoing research on concurrent systems and Petri nets.
Petri nets. --- Computer multitasking. --- Computer science. --- Data structures (Computer science). --- Information theory. --- Microprogramming. --- Computer engineering. --- Computer networks. --- Software engineering. --- Theory of Computation. --- Data Structures and Information Theory. --- Control Structures and Microprogramming. --- Computer Engineering and Networks. --- Software Engineering.
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 34 | << page >> |
Sort by
|