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

— —

E. -R. Olderog (Carl V. Ossietzky Universität Oldenburg, Germany) Ernst-Rudiger Olderog

Nets, Terms and Formulas

Three Views of Concurrent Processes and their Relationship

E. -R. Olderog (Carl V. Ossietzky Universität Oldenburg, Germany), Ernst-Rudiger Olderog, C. J. Van Rijsbergen , S. Abramsky

$78.95

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Cambridge University Press
25 August 2005

Mathematical theory of computation; Parallel processing

Series: Cambridge Tracts in Theoretical Computer Science

The author presents a theory of concurrent processes where three different semantic description methods that are usually studied in isolation are brought together. Petri nets describe processes as concurrent and interacting machines; algebraic process terms describe processes as abstract concurrent processes; and logical formulas specify the intended communication behaviour of processes. At the heart of this theory are two sets of transformation rules for the top-down design of concurrent processes. The first set can be used to transform stepwise logical formulas into process terms, whilst process terms can be transformed into Petri nets by the second set. These rules are based on novel techniques for the operational and denotational semantics of concurrent processes. Various results and relationships between nets, terms and formulas starting with formulas and illustrated by examples. The use of transformations is demonstrated in a series of case studies, and the author also identifies directions for future research. The book is written for graduate students and researchers in computer science; the author assumes a basic understanding of mathematical terminology, predicate logic and programming, but develops the semantic concepts used in a self-contained manner. The core of the material can be used for a one-semester course on concurrent processes. The book is self-contained in the semantics used, and will be of considerable interest to researchers and graduates in computer science working in models of concurrency.

By: E. -R. Olderog (Carl V. Ossietzky Universität Oldenburg Germany), Ernst-Rudiger Olderog
Series edited by: C. J. Van Rijsbergen, S. Abramsky, P. H. Aczel
Imprint: Cambridge University Press
Country of Publication: United Kingdom
Volume: 23
Dimensions: Height: 245mm, Width: 170mm, Spine: 15mm
Weight: 446g
ISBN: 9780521018456
ISBN 10: 0521018455
Series: Cambridge Tracts in Theoretical Computer Science
Pages: 280
Publication Date: 25 August 2005
Audience: Professional and scholarly , Undergraduate
Format: Paperback
Publisher's Status: Active

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

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

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