Ioannis Sorokos

Ioannis Sorokos

Auto-generated profile, based on publicly available information

Ioannis Sorokos

Fraunhofer IESE

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

22 May 2020 in IEEE Access
Verified
Journal Article
Open access
SKSohag Kabir
Sohag Kabir
Koorosh AslansefatKoorosh Aslansefat
Koorosh Aslansefat
ISIoannis Sorokos
Ioannis Sorokos
Yiannis PapadopoulosYiannis Papadopoulos
Yiannis Papadopoulos
SKSavas Konur
Savas Konur
Over the years, several approaches have been developed for the quantitative analysis of dynamic fault trees (DFTs). These approaches have strong theoretical and mathematical foundations; however, they appear to suffer from the state-space explosion and high computational requirements, compromising their efficacy. Modularisation techniques have been developed to address these issues by identifying and quantifying static and dynamic modules of the fault tree separately by using binary decision diagrams and Markov models. Although these approaches appear effective in reducing computational effort and avoiding state-space explosion, the reliance of the Markov chain on exponentially distributed data of system components can limit their widespread industrial applications. In this paper, we propose a hybrid modularisation scheme where independent sub-trees of a DFT are identified and quantified in a hierarchical order. A hybrid framework with the combination of algebraic solution, Petri Nets, and Monte Carlo simulation is used to increase the efficiency of the solution. The proposed approach uses the advantages of each existing approach in the right place (independent module). We have experimented the proposed approach on five independent hypothetical and industrial examples in which the experiments show the capabilities of the proposed approach facing repeated basic events and non-exponential failure distributions. The proposed approach could provide an approximate solution to DFTs without unacceptable loss of accuracy. Moreover, the use of modularised or hierarchical Petri nets makes this approach more generally applicable by allowing quantitative evaluation of DFTs with a wide range of failure rate distributions for basic events of the tree.

4 October 2023 in IEEE Software
Verified
Journal Article
Closed access
Koorosh AslansefatKoorosh Aslansefat
Koorosh Aslansefat
MHMojgan Hashemian
Mojgan Hashemian
MWMartin Walker
Martin Walker
MAMohammed Naveed Akram
Mohammed Naveed Akram
ISIoannis Sorokos
Ioannis Sorokos
Yiannis PapadopoulosYiannis Papadopoulos
Yiannis Papadopoulos
Machine learning is currently undergoing an explosion in capability, popularity, and sophistication. However, one of the major barriers to widespread acceptance of machine learning (ML) is trustworthiness: most ML models operate as black boxes, their inner workings opaque and mysterious, and it can be difficult to trust their conclusions without understanding how those conclusions are reached. Explainability is therefore a key aspect of improving trustworthiness: the ability to better understand, interpret, and anticipate the behaviour of ML models. To this end, we propose SMILE, a new method that builds on previous approaches by making use of statistical distance measures to improve explainability while remaining applicable to a wide range of input data domains.

25 August 2021
Verified
Book Chapter
Closed access
PDF file
ASAndreas Schmidt
Andreas Schmidt
JFJoshua Frey
Joshua Frey
DHDaniel Hillen
Daniel Hillen
JHJessica Horbelt
Jessica Horbelt
MSMarkus Schandar
Markus Schandar
ISIoannis Sorokos
Ioannis Sorokos


15 October 2024 in Journal of Systems and Software
Verified
Journal Article
Open access
ARAthanasios Retouniotis
Athanasios Retouniotis
Yiannis PapadopoulosYiannis Papadopoulos
Yiannis Papadopoulos
ISIoannis Sorokos
Ioannis Sorokos