kth.sePublications KTH
Operational message
There are currently operational disruptions. Troubleshooting is in progress.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Reliability Based Classification of Transitions in Complex Semi-Markov Models
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematical Statistics.
2022 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesisAlternative title
Tillförlitlighetsbaserad klassificering av övergångar i komplexa semi-markovmodeller (Swedish)
Abstract [en]

Markov processes have a long history of being used to model safety critical systems. However, with the development of autonomous vehicles and their increased complexity, Markov processes have been shown to not be sufficiently precise for reliability calculations. Therefore there has been the need to consider a more general stochastic process, namely the Semi-Markov process (SMP). SMPs allow for transitions with general distributions between different states and can be used to precisely model complex systems. This comes at the cost of increased complexity when calculating the reliability of systems. As such, methods to increase the interpretability of the system and allow for appropriate approximations have been considered and researched. In this thesis, a novel classification approach for transitions in SMP has been defined and complemented with different conjectures and properties. A transition is classified as good or bad by comparing the reliability of the original system with the reliability of any perturbed system, for which the studied transition is more likely to occur. Cases are presented to illustrate the use of this classification technique. Multiple suggestions and conjectures for future work are also presented and discussed.

Abstract [sv]

Markovprocesser har länge använts för att modellera säkerhetskritiska system. Med utvecklingen av autonoma fordon och deras ökade komplexitet, har dock markovprocesser visat sig vara otillräckliga exakta för tillförlitlighetsberäkningar. Därför har det funnits ett behov för en mer allmän stokastisk process, nämligen semi-markovprocessen (SMP). SMP tillåter generella fördelningar mellan tillstånd och kan användas för att modellera komplexa system med hög noggrannhet. Detta innebär dock en ökad komplexitet vid beräkningen av systemens tillförlitlighet. Metoder för att öka systemets tolkningsbarhet och möjliggöra lämpliga approximationer har därför övervägts och undersökts. I den här masteruppsatsen har en ny klassificeringsmetod för övergångar i SMP definierats och kompletteras med olika antaganden och egenskaper. En övergång klassificeras som antingen bra eller dålig genom en jämförelse av tillförlitligheten i det ursprungliga systemets och ett ändrat system, där den studerade övergången har högre sannolikhet att inträffa. Fallstudier presenteras för att exemplifiera användningen av denna klassificeringsteknik. Flera förslag och antaganden för framtida arbete presenteras och diskuteras också.

Place, publisher, year, edition, pages
2022. , p. 83
Series
TRITA-SCI-GRU ; 2022:312
Keywords [en]
Semi-Markov process, reliability engineering, stochastic process, autonomous vehicles
Keywords [sv]
semi-markovprocessen, tillförlitlighetsteknik, stokastisk process, autonoma fordon
National Category
Other Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-322560OAI: oai:DiVA.org:kth-322560DiVA, id: diva2:1720663
External cooperation
Scania AB
Subject / course
Mathematics
Educational program
Master of Science - Applied and Computational Mathematics
Supervisors
Examiners
Available from: 2023-02-02 Created: 2022-12-20 Last updated: 2023-02-02Bibliographically approved

Open Access in DiVA

fulltext(1042 kB)302 downloads
File information
File name FULLTEXT01.pdfFile size 1042 kBChecksum SHA-512
764ae2122e36245c92c966d1df55c9f782a5360765642a3ea2d1a143b36f7eace746c113eecb8ca1f7db8e1a1e62e9a4ec42d3861d7af8278bc9e9652fdb89f6
Type fulltextMimetype application/pdf

By organisation
Mathematical Statistics
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 302 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 484 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf