CaltechAUTHORS
  A Caltech Library Service

Concurrency Algebra and Petri Nets

Choo, Young-il (1985) Concurrency Algebra and Petri Nets. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1985.5190-tr-85

[img]
Preview
Postscript
See Usage Policy.

620Kb
[img]
Preview
Other (Adobe PDF (532KB))
See Usage Policy.

520Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:1985.5190-tr-85

Abstract

Concurrency Algebra is an algebraic framework for reasoning about the dynamic behavior of Petri nets. Based on a simple algebra containing concatenation, choice, and shuffle of strings, concurrency algebra uses a substitution schema determined by the structure of the given Petri net to generate new terms that denote its behavior. For non-terminating Petri nets, the behavior becomes the smallest set of strings satisfying a recursive equation over sets of strings.


Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Record Number:CaltechCSTR:1985.5190-tr-85
Persistent URL:http://resolver.caltech.edu/CaltechCSTR:1985.5190-tr-85
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26954
Collection:CaltechCSTR
Deposited By: Imported from CaltechCSTR
Deposited On:25 Jul 2002
Last Modified:26 Dec 2012 14:10

Repository Staff Only: item control page