Skip to main content
  • Book
  • © 2006

Concurrency Theory

Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

  • First book to adopt the approach taken by the LOTOS process calculi and its theory
  • Combines timed automata with region graph based model-checking – a highly topical approach
  • Includes supplementary material: sn.pub/extras

Buy it now

Buying options

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (13 chapters)

  1. Front Matter

    Pages I-XXIV
  2. Introduction

    1. Front Matter

      Pages 1-1
  3. Concurrency Theory — Untimed Models

    1. Front Matter

      Pages 15-17
  4. Concurrency Theory — Further Untimed Notations

    1. Front Matter

      Pages 181-183
    2. Beyond pbLOTOS

      Pages 185-214
    3. Communicating Automata

      Pages 233-255
  5. Concurrency Theory — Timed Models

    1. Front Matter

      Pages 257-259
    2. Discrete Timed Automata

      Pages 377-395
  6. Back Matter

    Pages 397-435

About this book

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.

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)

Authors and Affiliations

  • Computing Laboratory, University of Kent at Canterbury, Canterbury Kent, UK

    Howard Bowman, Rodolfo Gomez

Bibliographic Information

  • Book Title: Concurrency Theory

  • Book Subtitle: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

  • Authors: Howard Bowman, Rodolfo Gomez

  • DOI: https://doi.org/10.1007/1-84628-336-1

  • Publisher: Springer London

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag London 2006

  • Hardcover ISBN: 978-1-85233-895-4Published: 21 December 2005

  • Softcover ISBN: 978-1-84996-951-2Published: 13 October 2010

  • eBook ISBN: 978-1-84628-336-9Published: 28 February 2006

  • Edition Number: 1

  • Number of Pages: XX, 422

  • Number of Illustrations: 126 b/w illustrations

  • Topics: Theory of Computation, Software Engineering, Logics and Meanings of Programs

Buy it now

Buying options

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access