Process Algebra for Parallel and Distributed Processing

Regular price €167.40
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
abstract
Abstract Machine
ADL
Business Process
CA
Category=UB
Category=UKC
Category=UYF
Clustering Version
code
Code Graphs
Code Mobility
Composite Connector
composition
concurrency in software engineering
concurrent systems modelling
Control Flow Graphs
data
Data Flow Graph
distributed computing theory
DMA Transfer
embedded real-time systems
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Execution Time
formal methods for parallel algorithms
formal verification methods
Functional Languages
machine
Map Euler
Middleware Systems
mobility
Multicore Parallelism
multicore programming techniques
net
Packet Filter
Parallel Composition
petri
Process Algebras
Process Calculus
Process Specification Language
Proof Obligations
Refinement Calculus
Run Time System
Software Product Lines
stem
types

Product details

  • ISBN 9781420064865
  • Weight: 756g
  • Dimensions: 156 x 234mm
  • Publication Date: 22 Dec 2008
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns

Collects the Latest Research Involving the Application of Process Algebra to Computing

Exploring state-of-the-art applications, Process Algebra for Parallel and Distributed Processing shows how one formal method of reasoning—process algebra—has become a powerful tool for solving design and implementation challenges of concurrent systems.

Parallel ProgrammingDivided into three parts, the book begins by parallelizing an algorithm for the Cell Broadband Engine processor of IBM, Sony, and Toshiba. It also develops a runtime environment that can be ported to different parallel platforms and describes the formal model of action systems.

Distributed SystemsThe next part presents a process algebra (mCRL2) that targets distributed applications, looks at how to turn prose descriptions into unambiguous specifications, extends pi-calculus to create a service-oriented mobility abstract machine, and introduces the Channel Ambient Machine for mobile applications.

Embedded SystemsThe final section combines state-based Z with the event-based process algebra CSP in a formal methodology called Circus. It also develops a pair of process algebras (PARS) to address the problem of scheduling in real-time embedded systems and emphasizes the reuse of concurrent artifacts across different hardware platforms.

Highlighting recent research work, this volume addresses multicore programming problems and the evolution of the growing body of concurrency-enabled languages. It proposes solutions to the problems of designing and implementing today’s concurrency-constrained multicore processor and cloud architectures.

Dr. Michael Alexander, IBM, Vienna, Austria

Dr. William Gardner, University of Guelph, Ontario, Canada