Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/18678Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Janicki, Ryszard | - |
| dc.contributor.author | Adams, Stephen W. | - |
| dc.date.accessioned | 2016-01-05T20:01:43Z | - |
| dc.date.available | 2016-01-05T20:01:43Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.uri | http://hdl.handle.net/11375/18678 | - |
| dc.description.abstract | Petri nets are a graphical construction with clearly de ned semantics which can model concurrent communicating systems in a formal manner similar to the way that automata theory can model formal language theory(Petri, 1962). As Dr. Carl Petri found the existing automata insu cient or too cumbersome for describing communicating systems others have found Petri Nets to be too cumbersome for e ectively reasoning about sophisticated, real world systems. In some cases these di culties were overcome by extending the theory of Petri Nets. Dr. Kurt Jensen developed the theory of Coloured Petri Nets (Jensen, 1981) for the purpose of generalizing and simplifying complex Petri Net models. This work incorporates Coloured Petri Nets and other theoretical extensions to describe a real world automated steel cutting system. During the course of this investigation the paper will formalize colours in the language of algebras and examine patterns related to timing conditions. | en_US |
| dc.language.iso | en | en_US |
| dc.subject | petri net, coloured, alegbra, graph, automation, part cutting | en_US |
| dc.title | An Investigation of Coloured Petri Nets:Automated Part Cutting Case Study | en_US |
| dc.type | Thesis | en_US |
| dc.contributor.department | Computer Science | en_US |
| dc.description.degreetype | Thesis | en_US |
| dc.description.degree | Master of Science (MSc) | en_US |
| dc.description.layabstract | Petri nets can provide a graphical explanation of computer systems that have sophisticated communications. The graph has a precise mathematical meaning which allows it to be formally analyzed to prove many interesting properites of the net. There have been many extensions of the theory, some of which are incorporated to this model of an automated steel cutting machine. This thesis also presents the idea of colours, or data types, in the language of algebras. | en_US |
| Appears in Collections: | Open Access Dissertations and Theses | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| adams_stephen_w_201403_msc.pdf | Stephen W. Adams' M.Sc. Thesis | 2.07 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.
