My Wish Lists Login / Join

Concurrency Theory

Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

By: Howard Bowman, Rodolfo Gomez

Write A Review

Hardcover | 21 December 2005

At a Glance

Hardcover
460 Pages

Dimensions(cm)
23.5 x 15.88 x 2.54

Hardcover

$240.99

or 4 interest-free payments of $60.25 with

Ships in 5 to 7 business days

Intheworldweliveinconcurrencyisthenorm.Forexample,thehumanbody isamassivelyconcurrentsystem,comprisingahugenumberofcells,allsim- taneously evolving and independently engaging in their individual biological processing.Inaddition,inthebiologicalworld,trulysequentialsystemsrarely arise. However, they are more common when manmade artefacts are cons- ered. In particular, computer systems are often developed from a sequential perspective. Why is this? The simple reason is that it is easier for us to think about sequential, rather than concurrent, systems. Thus, we use sequentiality as a device to simplify the design process. However, the need for increasingly powerful, ?exible and usable computer systems mitigates against simplifying sequentiality assumptions. A good - ample of this is the all-powerful position held by the Internet, which is highly concurrent at many di?erent levels of decomposition. Thus, the modern c- puter scientist (and indeed the modern scientist in general) is forced to think aboutconcurrentsystemsandthesubtleandintricatebehaviourthatemerges from the interaction of simultaneously evolving components. Over a period of 25 years, or so, the ?eld of concurrency theory has been involved in the development of a set of mathematical techniques that can help system developers to think about and build concurrent systems. These theories are the subject matter of this book.

Industry Reviews

From the reviews: "This book covers a wide range of results from works in concurrency theory ! . scientists and students doing research in various related areas such as concurrency control or parallel computing will find this book quite useful. ! the book represents a comprehensive coverage of the development of concurrency theory reflecting the historical progression of the field. ! The book undoubtedly will suit students and specialists doing research in concurrency theory ! ." (Alekber Aliyev, Zentralblatt MATH, Vol. 1140, 2008)

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Computer Architecture & Logic Design Parallel Processing Computer Programming & Software Development Software Engineering Mathematical Theory of Computation

Other Editions and Formats

Paperback

Published: 13th October 2010

View Product

Introduction
Background on Concurrency Theory	p. 3
Concurrency Is Everywhere	p. 3
Characteristics of Concurrent Systems	p. 4
Classes of Concurrent Systems	p. 6
Basic Event Ordering	p. 6
Timing Axis	p. 7
Probabilistic Choice Axis	p. 8
Mobility Axis	p. 9
Mathematical Theories	p. 9
Overview of Book	p. 13
Concurrency Theory - Untimed Models
Process Calculi: LOTOS	p. 19
Introduction	p. 19
Example Specifications	p. 20
A Communication Protocol	p. 20
The Dining Philosophers	p. 22
Primitive Basic LOTOS	p. 22
Abstract Actions	p. 26
Action Prefix	p. 28
Choice	p. 29
Nondeterminism	p. 30
Process Definition	p. 34
Concurrency	p. 41
Sequential Composition and Exit	p. 47
Syntax of pbLOTOS	p. 50
Example	p. 52
Basic Interleaved Semantic Models	p. 55
A General Perspective on Semantics	p. 55
Why Semantics?	p. 55
Formal Definition	p. 57
Modelling Recursion	p. 61
What Makes a Good Semantics?	p. 63
Trace Semantics	p. 63
The Basic Approach	p. 63
Formal Semantics	p. 66
Development Relations	p. 73
Discussion	p. 75
Labelled Transition Systems	p. 76
The Basic Approach	p. 76
Formal Semantics	p. 78
Development Relations	p. 85
Verification Tools	p. 101
Overview of CADP	p. 102
Bisimulation Checking in CADP	p. 103
True Concurrency Models: Event Structures	p. 105
Introduction	p. 105
The Basic Approach - Event Structures	p. 107
Event Structures and pbLOTOS	p. 112
An Event Structures Semantics for pbLOTOS	p. 115
Relating Event Structures to Labelled Transition Systems	p. 123
Development Relations	p. 126
Alternative Event Structure Models	p. 134
Summary and Discussion	p. 138
Testing Theory and the Linear Time - Branching Time Spectrum	p. 141
Trace-refusals Semantics	p. 141
Introduction	p. 141
The Basic Approach	p. 143
Deriving Trace-refusal Pairs	p. 145
Internal Behaviour	p. 146
Development Relations: Equivalences	p. 152
Nonequivalence Development Relations	p. 154
Explorations of Congruence	p. 158
Summary and Discussion	p. 159
Testing Justification for Trace-refusals Semantics	p. 160
Testing Theory in General and the Linear Time - Branching Time Spectrum	p. 161
Sequence-based Testing	p. 162
Tree-based Testing	p. 163
Applications of Trace-refusals Relations in Distributed Systems	p. 166
Relating OO Concepts to LOTOS	p. 166
Behavioural Subtyping	p. 167
Viewpoints and Consistency	p. 177
Concurrency Theory - Further Untimed Notations
Beyond pbLOTOS	p. 185
Basic LOTOS	p. 185
Disabling	p. 185
Generalised Choice	p. 188
Generalised Parallelism	p. 189
Verbose Specification Syntax	p. 190
Verbose Process Syntax	p. 190
Syntax of bLOTOS	p. 191
Full LOTOS	p. 192
Guarded Choice	p. 193
Specification Notation	p. 193
Process Definition and Invocation	p. 194
Value Passing Actions	p. 194
Local Definitions	p. 202
Selection Predicates	p. 202
Generalised Choice	p. 203
Parameterised Enabling	p. 204
Syntax of fLOTOS	p. 206
Comments	p. 206
Examples	p. 207
Communication Protocol	p. 207
Dining Philosophers	p. 210
Extended LOTOS	p. 213
Comparison of LOTOS with CCS and CSP	p. 215
CCS and LOTOS	p. 217
Parallel Composition and Complementation of Actions	p. 217
Restriction and Hiding	p. 220
Internal Behaviour	p. 221
Minor Differences	p. 221
CSP and LOTOS	p. 222
Alphabets	p. 222
Internal Actions	p. 224
Choice	p. 225
Parallelism	p. 227
Hiding	p. 227
Comparison of LOTOS Trace-refusals with CSP Failures-divergences	p. 228
Communicating Automata	p. 233
Introduction	p. 233
Networks of Communicating Automata	p. 234
Component Automata	p. 234
Parallel Composition	p. 236
Example Specifications	p. 239
Semantics and Development Relations	p. 240
Verification of Networks of Communicating Automata	p. 241
Relationship to Process Calculi	p. 246
Infinite State Communicating Automata	p. 250
Networks of Infinite State Communicating Automata	p. 251
Semantics of ISCAs as Labelled Transition Systems	p. 254
Concurrency Theory - Timed Models
Timed Process Calculi, a LOTOS Perspective	p. 261
Introduction	p. 261
Timed LOTOS - The Issues	p. 262
Timed Action Enabling	p. 262
Urgency	p. 267
Persistency	p. 270
Nondeterminism	p. 271
Synchronisation	p. 272
Timing Domains	p. 273
Time Measurement	p. 273
Timing of Nonadjacent Actions	p. 274
Timed Interaction Policies	p. 275
Forms of Internal Urgency	p. 276
Discussion	p. 278
Timed LOTOS Notation	p. 278
The Language	p. 278
Example Specifications	p. 281
Timing Anomalies in tLOTOS	p. 283
E-LOTOS, the Timing Extensions	p. 285
Semantic Models for tLOTOS	p. 287
Branching Time Semantics	p. 287
Timed Transition Systems	p. 287
Operational Semantics	p. 289
Branching Time Development Relations	p. 299
True Concurrency Semantics	p. 304
Introduction	p. 304
Timed Bundle Event Structures	p. 305
Causal Semantics for tLOTOS	p. 308
Anomalous Behaviour	p. 318
Discussion	p. 320
Timed Communicating Automata	p. 321
Introduction	p. 321
Timed Automata - Formal Definitions	p. 323
Syntax	p. 324
Semantics	p. 325
Real-time Model-checking	p. 332
Forward Reachability	p. 333
Example: Reachability Analysis on the Multimedia Stream	p. 341
Issues in Real-time Model-checking	p. 342
Timelocks in Timed Automata	p. 347
Introduction	p. 347
A Classification of Deadlocks in Timed Automata	p. 349
Discussion: Justifying the Classification of Deadlocks	p. 350
Discussion: Timelocks in Process Calculi	p. 351
Time-actionlocks	p. 352
Timed Automata with Deadlines	p. 353
Example: A TAD Specification for the Multimedia Stream	p. 358
Zeno-timelocks	p. 359
Example: Zeno-timelocks in the Multimedia Stream	p. 359
Nonzenoness: Syntactic Conditions	p. 361
Nonzenoness: A Sufficient-and-Necessary Condition	p. 368
Timelock Detection in Real-time Model-checkers	p. 374
Uppaal	p. 374
Kronos	p. 376
Discrete Timed Automata	p. 377
Infinite vs. Finite States	p. 377
Preliminaries	p. 380
Fair Transition Systems and Invariance Proofs	p. 381
The Weak Monadic Second-order Theory of 1 Successor (WS1S) and MONA	p. 383
Discrete Timed Automata - Formal definitions	p. 384
Syntax	p. 384
Example: A DTA Specification for the Multimedia Stream	p. 386
Semantics	p. 387
Verifying Safety Properties over DTAs	p. 389
Discussion: Comparing DTAs and TIOAs with Urgency	p. 394
References	p. 397
Appendix	p. 409
Enabling as a Derived Operator	p. 409
Strong Bisimulation Is a Congruence	p. 409
Weak Bisimulation Congruence	p. 414
Timed Enabling as a Derived Operator	p. 419
Hiding is Not Substitutive for Timed Bisimulations	p. 420
Substitutivity of Timed Strong Bisimulation	p. 420
Substitutivity of Timed Rooted Weak Bisimulation	p. 422
Index	p. 429
Table of Contents provided by Publisher. All Rights Reserved.

Concurrency Theory

Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

At a Glance

Hardcover

Industry Reviews

Shipping

How to return your order

Defective items

You Can Find This Book In

Other Editions and Formats

Paperback

More in Mathematical Theory of Computation

Artificial Intelligence in Modeling and Simulation

Simulation Foundations, Methods and Applications

Discrete Mathematics for Computing

Grassroots

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

Effective Machine Learning Teams

Best Practices for ML Practitioners

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

Nonlinear Analysis for Human Movement Variability

Decentralized Futures

Navigating the Integration of Blockchain Technology with Artificial Intelligence

Machine Learning Interviews

Kickstart Your Machine Learning and Data Career

Introduction to Modern Cryptography

Revised Third Edition

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

The Indeterminacy of Computation

Elements in the Philosophy of Mathematics

The Indeterminacy of Computation

Elements in the Philosophy of Mathematics

Computability and Computational Explanation

Elements in the Philosophy of Mathematics

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Graphical Models and Causal Discovery with Python

100 Exercises for Building Logic

Sampling, Frames, and Harmonic Analysis

A Mathematical Celebration of Akram Aldroubi's 65th Birthday

Numerical Software Libraries and their Impact on Scientific Applications

ICIAM2023 Springer Series

Next Generation Arithmetic

6th International Conference, CoNGA 2025, St. Louis, MO, USA, November 14-15, 2025, Proceedings

The Mathematical Foundations of Large Language Models

An Introduction to Single-User Information Theory

Springer Undergraduate Texts in Mathematics and Technology

Quantum Machine Learning

Theory and Practice

Federated Learning for Privacy-Preserving AI Systems

Theory, Applications, and Implementation

This product is categorised by