Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Symbolic techniques for the performance analysis of generalised stochastic petri nets
Includes abstract Thesis (M.Sc. (Computer Science))-- University of Cape Town, 2001.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Computer Science
2014
|
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613246626725888 |
|---|---|
| access_status_str | Open Access |
| author | Davies, Ian |
| author2 | Kritzinger, Pieter S |
| author_browse | Davies, Ian Kritzinger, Pieter S |
| author_facet | Kritzinger, Pieter S Davies, Ian |
| author_sort | Davies, Ian |
| collection | Thesis |
| description | Includes abstract Thesis (M.Sc. (Computer Science))-- University of Cape Town, 2001. |
| format | Thesis |
| id | oai:open.uct.ac.za:11427/6389 |
| institution | University of Cape Town (South Africa) |
| language | eng |
| last_indexed | 2026-06-10T12:33:05.164Z |
| license_str | Not specified — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository |
| publishDate | 2014 |
| publishDateRange | 2014 |
| publishDateSort | 2014 |
| publisher | Department of Computer Science |
| publisherStr | Department of Computer Science |
| record_format | dspace |
| source_str | UCTD — University of Cape Town Open Access Repository |
| spelling | oai:open.uct.ac.za:11427/6389 Symbolic techniques for the performance analysis of generalised stochastic petri nets Davies, Ian Kritzinger, Pieter S Includes abstract Thesis (M.Sc. (Computer Science))-- University of Cape Town, 2001. Includes bibliographical references. Binary Decision Diagrams (BDDs) have been successfully used in sequential circuit theory, VLSI, and model checking. They form a highly memory efficient canonical representation of a Boolean function. In this dissertation, following on the success of BDDs in other fields, we investiage the applicability of symbolic techniques in the performance analysis of timed transition systems, particularly those of Generalised Stochastic Petri Nets (GSPNs). We make use of symbolic methods, where states are represented implicitly rather than explicitly, primarily to conserve memory during the state space exploration process - a necessary step in the performance analysis pipeline. We have investigated the use of BDDs in two different ways. The first, our own novel technique, allows the user to effectively place an upper bound on the amount of memory to use during state space exploration. The second makes use of transition to find the successor states at each level of the state graph. Both of these techniques rely on a novel and efficient GSPN to BDD encoding function that we have derived. 2014-08-13T19:28:41Z 2014-08-13T19:28:41Z 2001 Master Thesis Masters MSc http://hdl.handle.net/11427/6389 eng application/pdf Department of Computer Science Faculty of Science University of Cape Town |
| spellingShingle | Davies, Ian Symbolic techniques for the performance analysis of generalised stochastic petri nets |
| thesis_degree_str | Master's |
| title | Symbolic techniques for the performance analysis of generalised stochastic petri nets |
| title_full | Symbolic techniques for the performance analysis of generalised stochastic petri nets |
| title_fullStr | Symbolic techniques for the performance analysis of generalised stochastic petri nets |
| title_full_unstemmed | Symbolic techniques for the performance analysis of generalised stochastic petri nets |
| title_short | Symbolic techniques for the performance analysis of generalised stochastic petri nets |
| title_sort | symbolic techniques for the performance analysis of generalised stochastic petri nets |
| url | http://hdl.handle.net/11427/6389 |
| work_keys_str_mv | AT daviesian symbolictechniquesfortheperformanceanalysisofgeneralisedstochasticpetrinets |