No Cover Image

E-Thesis 302 views 223 downloads

Use of synchronous concurrent algorithms in the development of safety related software. / Adam James Tacy

Swansea University Author: Adam James Tacy

Abstract

This thesis investigates the use of Synchronous Concurrent Algorithms (SCAs) in the development of safety related software, where a stricter adherence to mathematical correctness is required. The original model of SCAs is extended to produce abstract and concrete dynamic SCAs (dSCAs) that allow dyna...

Full description

Published: 2005
Institution: Swansea University
Degree level: Doctoral
Degree name: Ph.D
URI: https://cronfa.swan.ac.uk/Record/cronfa42576
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2018-08-02T18:55:02Z
last_indexed 2018-08-03T10:10:31Z
id cronfa42576
recordtype RisThesis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2018-08-02T16:24:29.7278068</datestamp><bib-version>v2</bib-version><id>42576</id><entry>2018-08-02</entry><title>Use of synchronous concurrent algorithms in the development of safety related software.</title><swanseaauthors><author><sid>83a8f4255336ed0b2a98c5d0a0ae5109</sid><ORCID>NULL</ORCID><firstname>Adam James</firstname><surname>Tacy</surname><name>Adam James Tacy</name><active>true</active><ethesisStudent>true</ethesisStudent></author></swanseaauthors><date>2018-08-02</date><abstract>This thesis investigates the use of Synchronous Concurrent Algorithms (SCAs) in the development of safety related software, where a stricter adherence to mathematical correctness is required. The original model of SCAs is extended to produce abstract and concrete dynamic SCAs (dSCAs) that allow dynamic, but predictable, SCAs to be produced whose wiring maybe different at different values of a program counter. A relaxed implementation of the Generalised Railroad Crossing Problem is used to demonstrate each of the SCA models. SCAs were originally defined by Tucker and Thompson and were restricted to unit-delays between modules. Hobley investigated the introduction of non-unit delay SCAs and how non-unit delay SCAs may be represented as unit delay SCAs. Poole, Tucker and Thompson introduced the concept of hierarchies of Spatially Expanded Systems, of which SCAs are a form. All of these tools are used and expanded upon in this thesis to provide a mechanism enabling an SCA representation of an algorithm to be transformed into an SCA representation of a computing device that implements that algorithm, and to be able to demonstrate correctness. As each SCA model can be represented algebraically, this thesis provides the transformations as meta-algebras, i.e. algebras that can transfrom one algebra to another algebra.</abstract><type>E-Thesis</type><journal/><journalNumber></journalNumber><paginationStart/><paginationEnd/><publisher/><placeOfPublication/><isbnPrint/><issnPrint/><issnElectronic/><keywords>Computer science.</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2005</publishedYear><publishedDate>2005-12-31</publishedDate><doi/><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><institution>Swansea University</institution><degreelevel>Doctoral</degreelevel><degreename>Ph.D</degreename><apcterm/><lastEdited>2018-08-02T16:24:29.7278068</lastEdited><Created>2018-08-02T16:24:29.7278068</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Adam James</firstname><surname>Tacy</surname><orcid>NULL</orcid><order>1</order></author></authors><documents><document><filename>0042576-02082018162505.pdf</filename><originalFilename>10805325.pdf</originalFilename><uploaded>2018-08-02T16:25:05.3600000</uploaded><type>Output</type><contentLength>10027995</contentLength><contentType>application/pdf</contentType><version>E-Thesis</version><cronfaStatus>true</cronfaStatus><embargoDate>2018-08-02T16:25:05.3600000</embargoDate><copyrightCorrect>false</copyrightCorrect></document></documents><OutputDurs/></rfc1807>
spelling 2018-08-02T16:24:29.7278068 v2 42576 2018-08-02 Use of synchronous concurrent algorithms in the development of safety related software. 83a8f4255336ed0b2a98c5d0a0ae5109 NULL Adam James Tacy Adam James Tacy true true 2018-08-02 This thesis investigates the use of Synchronous Concurrent Algorithms (SCAs) in the development of safety related software, where a stricter adherence to mathematical correctness is required. The original model of SCAs is extended to produce abstract and concrete dynamic SCAs (dSCAs) that allow dynamic, but predictable, SCAs to be produced whose wiring maybe different at different values of a program counter. A relaxed implementation of the Generalised Railroad Crossing Problem is used to demonstrate each of the SCA models. SCAs were originally defined by Tucker and Thompson and were restricted to unit-delays between modules. Hobley investigated the introduction of non-unit delay SCAs and how non-unit delay SCAs may be represented as unit delay SCAs. Poole, Tucker and Thompson introduced the concept of hierarchies of Spatially Expanded Systems, of which SCAs are a form. All of these tools are used and expanded upon in this thesis to provide a mechanism enabling an SCA representation of an algorithm to be transformed into an SCA representation of a computing device that implements that algorithm, and to be able to demonstrate correctness. As each SCA model can be represented algebraically, this thesis provides the transformations as meta-algebras, i.e. algebras that can transfrom one algebra to another algebra. E-Thesis Computer science. 31 12 2005 2005-12-31 COLLEGE NANME Computer Science COLLEGE CODE Swansea University Doctoral Ph.D 2018-08-02T16:24:29.7278068 2018-08-02T16:24:29.7278068 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Adam James Tacy NULL 1 0042576-02082018162505.pdf 10805325.pdf 2018-08-02T16:25:05.3600000 Output 10027995 application/pdf E-Thesis true 2018-08-02T16:25:05.3600000 false
title Use of synchronous concurrent algorithms in the development of safety related software.
spellingShingle Use of synchronous concurrent algorithms in the development of safety related software.
Adam James Tacy
title_short Use of synchronous concurrent algorithms in the development of safety related software.
title_full Use of synchronous concurrent algorithms in the development of safety related software.
title_fullStr Use of synchronous concurrent algorithms in the development of safety related software.
title_full_unstemmed Use of synchronous concurrent algorithms in the development of safety related software.
title_sort Use of synchronous concurrent algorithms in the development of safety related software.
author_id_str_mv 83a8f4255336ed0b2a98c5d0a0ae5109
author_id_fullname_str_mv 83a8f4255336ed0b2a98c5d0a0ae5109_***_Adam James Tacy
author Adam James Tacy
author2 Adam James Tacy
format E-Thesis
publishDate 2005
institution Swansea University
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 1
active_str 0
description This thesis investigates the use of Synchronous Concurrent Algorithms (SCAs) in the development of safety related software, where a stricter adherence to mathematical correctness is required. The original model of SCAs is extended to produce abstract and concrete dynamic SCAs (dSCAs) that allow dynamic, but predictable, SCAs to be produced whose wiring maybe different at different values of a program counter. A relaxed implementation of the Generalised Railroad Crossing Problem is used to demonstrate each of the SCA models. SCAs were originally defined by Tucker and Thompson and were restricted to unit-delays between modules. Hobley investigated the introduction of non-unit delay SCAs and how non-unit delay SCAs may be represented as unit delay SCAs. Poole, Tucker and Thompson introduced the concept of hierarchies of Spatially Expanded Systems, of which SCAs are a form. All of these tools are used and expanded upon in this thesis to provide a mechanism enabling an SCA representation of an algorithm to be transformed into an SCA representation of a computing device that implements that algorithm, and to be able to demonstrate correctness. As each SCA model can be represented algebraically, this thesis provides the transformations as meta-algebras, i.e. algebras that can transfrom one algebra to another algebra.
published_date 2005-12-31T03:53:14Z
_version_ 1763752641238663168
score 11.035655

Similar Items