Skip to content
Register Sign in Wishlist

Nets, Terms and Formulas
Three Views of Concurrent Processes and their Relationship

$56.00 (C)

Part of Cambridge Tracts in Theoretical Computer Science

  • Author: E. -R. Olderog, Carl V. Ossietzky Universität Oldenburg, Germany
  • Date Published: August 2005
  • availability: Available
  • format: Paperback
  • isbn: 9780521018456

$ 56.00 (C)
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • The author presents a theory whereby nets, terms and formulas represent concurrent process at three levels of abstractions: Petri nets are used to describe all details of the operational machine behavior of processes. Algebraic process terms such as Calculus of Communicating Systems (CCS) or Communicating Sequential Processes (CSP) two of the main models for parallel programming, are used to describe the architecture of processes, i.e. how they can be composed from subprocesses. Logical formulas of a first-order trace logic are used to describe the safety and liveness aspects of the communication behavior of processes as required by their users. The main emphasis and technical contribution of this theory are transformations for a top-down design of concurrent processes starting with formulas and proceeding through terms to nets.

    Reviews & endorsements

    "The unique feature of this book is that it unifies different views of concurrency rather than adding another view. The author does so in a clear and convincing fashion....requires the reader to be fluent in such mathematical concepts as sets, relations, functions, and predicate logic, and to be familiar with the basic concepts of automata and regular languages. Readers who enjoy the mathematical maturity will find the book excellent: it is carefully written, and the material is presented in a well-chosen order and at the right level of detail. The author must be a good teacher." Martin Rem, Computing Reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: August 2005
    • format: Paperback
    • isbn: 9780521018456
    • length: 280 pages
    • dimensions: 245 x 170 x 15 mm
    • weight: 0.446kg
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Petri nets
    3. Process terms
    4. Logical formulas
    5. Process construction
    6. Extensions
    References.

  • Author

    E. -R. Olderog, Carl V. Ossietzky Universität Oldenburg, Germany

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×