Skip to main content
SpringerLink
Log in
Book cover

Concurrency Theory

Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

  • Book
  • © 2006

Overview

Authors:
  1. Howard Bowman

    1. Computing Laboratory, University of Kent at Canterbury, Canterbury Kent, UK

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Rodolfo Gomez

    1. Computing Laboratory, University of Kent at Canterbury, Canterbury Kent, UK

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 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

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Front Matter

    Pages I-XXIV
    Download chapter PDF

  2. Introduction

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Background on Concurrency Theory

      Pages 3-13

  3. Concurrency Theory — Untimed Models

    1. Front Matter

      Pages 15-17
      Download chapter PDF

    2. Process Calculi: LOTOS

      Pages 19-54

    3. Basic Interleaved Semantic Models

      Pages 55-104

    4. True Concurrency Models: Event Structures

      Pages 105-139

    5. Testing Theory and the Linear Time — Branching Time Spectrum

      Pages 141-180

  4. Concurrency Theory — Further Untimed Notations

    1. Front Matter

      Pages 181-183
      Download chapter PDF

    2. Beyond pbLOTOS

      Pages 185-214

    3. Comparison of LOTOS with CCS and CSP

      Pages 215-232

    4. Communicating Automata

      Pages 233-255

  5. Concurrency Theory — Timed Models

    1. Front Matter

      Pages 257-259
      Download chapter PDF

    2. Timed Process Calculi, a LOTOS Perspective

      Pages 261-286

    3. Semantic Models for tLOTOS

      Pages 287-320

    4. Timed Communicating Automata

      Pages 321-345

    5. Timelocks in Timed Automata

      Pages 347-376

    6. Discrete Timed Automata

      Pages 377-395

  6. Back Matter

    Pages 397-435
    Download chapter PDF
Back to top

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation