Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/87205| Title: | From task graphs to petri nets |
| Authors: | Spiteri Staines, Tony |
| Keywords: | Petri nets Graphic methods -- Computer programs Program transformation (Computer programming) Computer systems -- Verification |
| Issue Date: | 2013 |
| Citation: | Spiteri Staines, A. (2013). From task graphs to petri nets. International Journal of Emerging Technology and Advanced Engineering, 3(2), 36-42 |
| Abstract: | This paper describes the similarities between task graphs and Petri nets and explains how a well formed task graph can be converted or transformed into a Petri net for verification, validation and checking using incidence matrix analysis, invariants and the reachability graph. A case study is presented, results and conclusions are given. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/87205 |
| ISSN: | 2250-2459 |
| Appears in Collections: | Scholarly Works - FacICTCIS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| From_task_graphs_to_petri_nets.pdf Restricted Access | 386.82 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.