September 24, 2021
The paper entitled “Modelling and Analysis of Fire Sprinklers by Verifying Dynamic Fault Trees” by Shahid Khan, Joost-Pieter Katoen, Matthias Volk, Ahmad Zafar and Falak Sher has been accepted for presentation at the 10th Latin-American Symposium on Dependable Computing (LADC 2021). The paper models fire sprinkler systems in shopping centers by dynamic fault trees and analyses them using probabilistic model checking.
September 16, 2021
The paper entitled “Synergising Reliability Modelling Languages: BDMPs and Repairable DFTs” by Shahid Khan and Joost-Pieter Katoen has been accepted for presentation at PRDC 2021, the IEEE Pacific Rim Dependability Conference. The paper proposes a translation from Boussiou’s BDMPs to repairable DFTs so as to use the repair mechanism of BDMP in rDFT. The validity of the translation is provided through the analysis using the probabilistic model-checking tool storm.
September 16, 2021
The paper entitled “DFT Modeling Approach for Operational Risk Assessment of Railway Infrastructure” by Matthias Volk, Norman Weik (DLR), Nils Nießen, and Joost-Pieter Katoen has been accepted for publication in the journal Software Tools for Technology Transfer (STTT). The paper is an extension of the FMICS 2019 paper (awarded the best paper award) and presents a fully automated manner for risk assessment of railway station infrastructural elements.
August 10, 2021
The paper entitled “Stochastic Games with Disjunctions of Multiple Objectives” by Tobias Winkler and Maxi Weininger (TU Munich) has been accepted for the Twelfth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2021). The paper provides new results on stochastic two-player games with disjunctive objectives given by an alternative of threshold conditions for the probability of reachability (or safety) conditions.
July 18, 2021
The tool paper “The Probabilistic Termination Tool Amber” by Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen and Laura Kovacs has been accpted to FM2021, the conference on Formal Methods. The paper presents the first tool that automates the checking whether a probabilistic program is AST, PAST, non-AST, non-PAST, or “don’t know”. (AST = almost-sure termination, PAST = positive AST).
July 13, 2021
The paper “Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata ” by Mikołaj Bojańczyk, Bartek Klin (both Warsaw Univ.) and Joshua Moerman was selected as Distinguished Paper at LICS 2021, the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
June 26, 2021
Christina Gehnen has received an award from the Fachgruppe Informatik at RWTH for her Bachelor’s thesis entitled “Automata-based Model Checking of Recursive Systems“. Congratulations!
June 23, 2021
The paper entitled “Fine-Tuning the Odds for Bayes Networks” by Bahare Salmani and Joost-Pieter Katoen has been accepted for the 16th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2021). The paper proposes the usage of parameter synthesis techniques for Markov chains to analyse Bayesian networks with symbolic parameters in the conditional probability tables, and experimentally compares this to existing analysis tools for Bayesian networks.
June 23, 2021
The paper entitled “Accelerating SpMV Multiplication in Probabilistic Model Checkers using GPUs” by Muhammad Hannan Khan (NUST), Osman Hasan (NUST) and Shahid Khan has been accepted at the 18th International Colloquium on Theoretical Aspects of Computing (ICTAC 2021). The paper introduces a GPU-based methodolgy to improve sparse-matrix vector multiplication in probabilistic model checking. The main contribution is a technique for hiding memory transfers, which represent a major bottleneck in…
Read more about Paper at ICTAC 2021June 8, 2021
The paper entitled “Tweaking the Odds in Probabilistic Timed Automata” by Arnd Hartmanns (Twente), Joost-Pieter Katoen, Bram Kohlen (Twente) and Jip Spel has been accepted at the 18th International Conference on Quantitative Evaluation of Systems (QEST 2021). The paper shows that two well-known techniques (digital clocks and backward reachability) for probabilistic timed automata (PTA) carry over to PTA with parametric probabilities in a rather starighforward manner. A prototypical tool…
Read more about Paper at QEST 2021May 28, 2021
The paper “PAYNT: A Tool for Inductive Synthesis of Probabilistic Programs” by Roman Andriushchenko, Milan Ceska, Sebastian Junges, Joost-Pieter Katoen and Simon Stupinsky has been accepted as tool paper at CAV 2021. The paper passed both the normal paper review as well as the artifact evaluation review. PAYNT is a tool that supports the automated synthesis of finite-state probabilistic programs and supports CEGAR-, CEGIS-, and a mixture of these techniques. This brings the total number of…
Read more about Tool Paper at CAV 2021May 15, 2021
The newspaper Aachener Nachrichten published the article Storm findet sicherheitskritische Softwarefehler. The article addresses Storm and its applications in industry.
April 30, 2021
The paper “A Modular Approach To Non-Deterministic Dynamic Fault Trees” by Sascha Müller, Adeline Jordon, Andreas Gerndt (all German Aerospace Center DLR, Braunschweig) and Thomas Noll has been accepted at the 40th International Conference on Computer Safety, Reliability and Security (SafeComp 2021). It presents a modular approach for synthesising recovery strategies from non-deterministic dynamic fault trees.
April 23, 2021
The papers on the Storm model checker and the parameter synthesis tool Prophesy are both among the five most cited CAV papers in the period 2015-2021. CAV (Computer-Aided Verification) is a flagship conference on automated verification, in particular model checking. More details can be found here: https://scholar.google.com.au/citations?hl=en&vq=eng%5Fcomputerhardwaredesign&view%5Fop=list%5Fhcore&venue=qgBvh59sjMQJ.2020
April 20, 2021
The paper “Automated Detection and Completion of Confluence for Graph Grammars” by Ira Fesefeldt, Christoph Matheja, Thomas Noll, and Johannes Schulte has been accepted as a tool paper at the International Conference on Graph Transformation (ICGT 2021). It presents an approach to check for a given context-free graph grammar whether the corresponding backward graph reduction system is confluent—a question that arises when using graph grammars to guide state space abstractions for analyzing…
Read more about Paper at ICGT 2021