No Cover Image

Journal article 66 views 9 downloads

A model of systems with modes and mode transitions

Edwin Beggs Orcid Logo, John Tucker Orcid Logo

Journal of Logical and Algebraic Methods in Programming, Volume: 127, Start page: 100774

Swansea University Authors: Edwin Beggs Orcid Logo, John Tucker Orcid Logo

  • 59740.pdf

    PDF | Version of Record

    © 2022 The Authors. This is an open access article under the CC BY license

    Download (787.2KB)

Abstract

We propose a method of classifying the operation of a system into finitely many modes. Each mode has its own objectives for the system's behaviour and its own algorithms designed to accomplish its objectives. A central problem is deciding when to transition from one mode to some other mode, a d...

Full description

Published in: Journal of Logical and Algebraic Methods in Programming
ISSN: 2352-2208
Published: Elsevier BV 2022
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa59740
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2022-03-30T07:34:33Z
last_indexed 2022-04-21T03:30:51Z
id cronfa59740
recordtype SURis
fullrecord <?xml version="1.0" encoding="utf-8"?><rfc1807 xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema"><bib-version>v2</bib-version><id>59740</id><entry>2022-03-30</entry><title>A model of systems with modes and mode transitions</title><swanseaauthors><author><sid>a0062e7cf6d68f05151560cdf9d14e75</sid><ORCID>0000-0002-3139-0983</ORCID><firstname>Edwin</firstname><surname>Beggs</surname><name>Edwin Beggs</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>431b3060563ed44cc68c7056ece2f85e</sid><ORCID>0000-0003-4689-8760</ORCID><firstname>John</firstname><surname>Tucker</surname><name>John Tucker</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2022-03-30</date><deptcode>SMA</deptcode><abstract>We propose a method of classifying the operation of a system into finitely many modes. Each mode has its own objectives for the system's behaviour and its own algorithms designed to accomplish its objectives. A central problem is deciding when to transition from one mode to some other mode, a decision that may be contested and involve partial or inconsistent information. We propose some general principles and model mathematically their conception of modes for a system. We derive a family of data types for analysing mode transitions; these are simplicial complexes, both abstract and concretely realised as geometric spaces in euclidean space . In the simplicial complex, a mode is represented by a simplex and each state of a system can be evaluated by mapping it into one or more simplices. This evaluation measures the extent to which different modes are appropriate for the state and can decide on a transition. To illustrate the general model in some detail, we work though a case study of an autonomous racing car.</abstract><type>Journal Article</type><journal>Journal of Logical and Algebraic Methods in Programming</journal><volume>127</volume><journalNumber/><paginationStart>100774</paginationStart><paginationEnd/><publisher>Elsevier BV</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>2352-2208</issnPrint><issnElectronic/><keywords>Modes of operation; Mode transitions; Abstract simplicial complexes; Presheaf of data types; Autonomous cars</keywords><publishedDay>1</publishedDay><publishedMonth>6</publishedMonth><publishedYear>2022</publishedYear><publishedDate>2022-06-01</publishedDate><doi>10.1016/j.jlamp.2022.100774</doi><url/><notes/><college>COLLEGE NANME</college><department>Mathematics</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SMA</DepartmentCode><institution>Swansea University</institution><apcterm>SU Library paid the OA fee (TA Institutional Deal)</apcterm><funders>None listed.</funders><projectreference/><lastEdited>2022-09-05T12:30:35.3493968</lastEdited><Created>2022-03-30T08:27:38.7399087</Created><path><level id="1">College of Science</level><level id="2">Mathematics</level></path><authors><author><firstname>Edwin</firstname><surname>Beggs</surname><orcid>0000-0002-3139-0983</orcid><order>1</order></author><author><firstname>John</firstname><surname>Tucker</surname><orcid>0000-0003-4689-8760</orcid><order>2</order></author></authors><documents><document><filename>59740__23900__78b5f0517849427e8520dbafc279a255.pdf</filename><originalFilename>59740.pdf</originalFilename><uploaded>2022-04-20T17:01:51.0649065</uploaded><type>Output</type><contentLength>806096</contentLength><contentType>application/pdf</contentType><version>Version of Record</version><cronfaStatus>true</cronfaStatus><documentNotes>© 2022 The Authors. This is an open access article under the CC BY license</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language><licence>http://creativecommons.org/licenses/by/4.0/</licence></document></documents><OutputDurs/></rfc1807>
spelling v2 59740 2022-03-30 A model of systems with modes and mode transitions a0062e7cf6d68f05151560cdf9d14e75 0000-0002-3139-0983 Edwin Beggs Edwin Beggs true false 431b3060563ed44cc68c7056ece2f85e 0000-0003-4689-8760 John Tucker John Tucker true false 2022-03-30 SMA We propose a method of classifying the operation of a system into finitely many modes. Each mode has its own objectives for the system's behaviour and its own algorithms designed to accomplish its objectives. A central problem is deciding when to transition from one mode to some other mode, a decision that may be contested and involve partial or inconsistent information. We propose some general principles and model mathematically their conception of modes for a system. We derive a family of data types for analysing mode transitions; these are simplicial complexes, both abstract and concretely realised as geometric spaces in euclidean space . In the simplicial complex, a mode is represented by a simplex and each state of a system can be evaluated by mapping it into one or more simplices. This evaluation measures the extent to which different modes are appropriate for the state and can decide on a transition. To illustrate the general model in some detail, we work though a case study of an autonomous racing car. Journal Article Journal of Logical and Algebraic Methods in Programming 127 100774 Elsevier BV 2352-2208 Modes of operation; Mode transitions; Abstract simplicial complexes; Presheaf of data types; Autonomous cars 1 6 2022 2022-06-01 10.1016/j.jlamp.2022.100774 COLLEGE NANME Mathematics COLLEGE CODE SMA Swansea University SU Library paid the OA fee (TA Institutional Deal) None listed. 2022-09-05T12:30:35.3493968 2022-03-30T08:27:38.7399087 College of Science Mathematics Edwin Beggs 0000-0002-3139-0983 1 John Tucker 0000-0003-4689-8760 2 59740__23900__78b5f0517849427e8520dbafc279a255.pdf 59740.pdf 2022-04-20T17:01:51.0649065 Output 806096 application/pdf Version of Record true © 2022 The Authors. This is an open access article under the CC BY license true eng http://creativecommons.org/licenses/by/4.0/
title A model of systems with modes and mode transitions
spellingShingle A model of systems with modes and mode transitions
Edwin Beggs
John Tucker
title_short A model of systems with modes and mode transitions
title_full A model of systems with modes and mode transitions
title_fullStr A model of systems with modes and mode transitions
title_full_unstemmed A model of systems with modes and mode transitions
title_sort A model of systems with modes and mode transitions
author_id_str_mv a0062e7cf6d68f05151560cdf9d14e75
431b3060563ed44cc68c7056ece2f85e
author_id_fullname_str_mv a0062e7cf6d68f05151560cdf9d14e75_***_Edwin Beggs
431b3060563ed44cc68c7056ece2f85e_***_John Tucker
author Edwin Beggs
John Tucker
author2 Edwin Beggs
John Tucker
format Journal article
container_title Journal of Logical and Algebraic Methods in Programming
container_volume 127
container_start_page 100774
publishDate 2022
institution Swansea University
issn 2352-2208
doi_str_mv 10.1016/j.jlamp.2022.100774
publisher Elsevier BV
college_str College of Science
hierarchytype
hierarchy_top_id collegeofscience
hierarchy_top_title College of Science
hierarchy_parent_id collegeofscience
hierarchy_parent_title College of Science
department_str Mathematics{{{_:::_}}}College of Science{{{_:::_}}}Mathematics
document_store_str 1
active_str 0
description We propose a method of classifying the operation of a system into finitely many modes. Each mode has its own objectives for the system's behaviour and its own algorithms designed to accomplish its objectives. A central problem is deciding when to transition from one mode to some other mode, a decision that may be contested and involve partial or inconsistent information. We propose some general principles and model mathematically their conception of modes for a system. We derive a family of data types for analysing mode transitions; these are simplicial complexes, both abstract and concretely realised as geometric spaces in euclidean space . In the simplicial complex, a mode is represented by a simplex and each state of a system can be evaluated by mapping it into one or more simplices. This evaluation measures the extent to which different modes are appropriate for the state and can decide on a transition. To illustrate the general model in some detail, we work though a case study of an autonomous racing car.
published_date 2022-06-01T12:30:31Z
_version_ 1743129078011002880
score 10.897118