Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/89857| Title: | Concurrency issues in ordinary place transition petri nets |
| Other Titles: | Communicating Process Architectures |
| Authors: | Spiteri Staines, Tony |
| Keywords: | Petri nets Network grammar Concurrent engineering |
| Issue Date: | 2017 |
| Publisher: | IOS Press |
| Citation: | Spiteri Staines, T. (2017). Concurrency issues in ordinary place transition petri nets. In J. Bækgaard Pedersen, K. Chalmers, J.F. Broenink (Eds.), Communicating Process Architectures, (pp. 1-10). Amsterdam: IOS Press |
| Abstract: | This paper explains concurrency issues present when modeling software systems using ordinary place transition nets. Normally it is assumed that ordinary (elementary) Petri net structures are concurrent or concurrency free. However it can be shown that concurrency does not depend only on the structure of a Petri net but on the distribution of resources in the net. A basic algebraic notation is used for representing concurrency. Examples are given showing different types of concurrency that can be detected in ordinary Petri net structures. These are classified into i) dependent and ii) temporal (weak) concurrency. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/89857 |
| Appears in Collections: | Scholarly Works - FacICTCIS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Concurrency_issues_in_ordinary_place_transition_petri_nets.pdf Restricted Access | 299.91 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.