Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-25T16:36:16.502Z Has data issue: false hasContentIssue false

6 - EXTENSIONS

Published online by Cambridge University Press:  06 January 2010

E. -R. Olderog
Affiliation:
Carl V. Ossietzky Universität Oldenburg, Germany
Get access

Summary

A crucial test for any theory of concurrent processes is case studies. These will clarify the application areas where this theory is particularly helpful but also reveal its shortcomings. Such shortcomings can be challenges for future research.

Considering all existing case studies based on Petri nets, algebraic process terms and logical formulas, it is obvious that these description methods are immensely helpful in specifying, constructing and verifying concurrent processes. We think in particular of protocol verification, e.g. [Vaa86, Bae90], the verification of VLSI algorithms, e.g. [Hen86], the design of computer architectures, e.g. [Klu87, DD89a, DD89b], and even of concurrent programming languages such as OCCAM [INM84, RH88] or POOL [Ame85, ABKR86, AR89, Vaa90]. However, these examples use one specific description method in each case.

Our overall aim is the smooth integration of description methods that cover different levels of abstraction in a top-down design of concurrent processes. This aim is similar to what Misra and Chandy have presented in their rich and beautiful book on UNITY [CM88]. However, we believe that their approach requires complementary work at the level of implementation, i.e. where UNITY programs are mapped onto architectures.

Our presentation of three different views of concurrent processes attempts to contribute to this overall aim. To obtain a coherent theory, we concentrated on a setting where simple classes of nets, terms and formulas are used. We demonstrated the applicability of this setting in a series of small but non-trivial process constructions.

Type
Chapter
Information
Nets, Terms and Formulas
Three Views of Concurrent Processes and their Relationship
, pp. 227 - 240
Publisher: Cambridge University Press
Print publication year: 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • EXTENSIONS
  • E. -R. Olderog, Carl V. Ossietzky Universität Oldenburg, Germany
  • Book: Nets, Terms and Formulas
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511526589.007
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • EXTENSIONS
  • E. -R. Olderog, Carl V. Ossietzky Universität Oldenburg, Germany
  • Book: Nets, Terms and Formulas
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511526589.007
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • EXTENSIONS
  • E. -R. Olderog, Carl V. Ossietzky Universität Oldenburg, Germany
  • Book: Nets, Terms and Formulas
  • Online publication: 06 January 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511526589.007
Available formats
×