8 citations · 22 across the 7 of their papers we have counts for
14 papers · 1 filter
Learning Model Checking and the Kernel Trick for Signal Temporal Logic on Stochastic Processes
Luca Bortolussi, Giuseppe Maria Gallo, Jan Křetínský +1
We introduce a similarity function on formulae of signal temporal logic (STL). It comes in the form of a kernel function, well known in machine learning as a conceptually and compu…
DeepAbstract: Neural Network Abstraction for Accelerating Verification
Pranav Ashok, Vahid Hashemi, Jan Křetínský +1
While abstraction is a classic tool of verification to scale it up, it is not used very often for verifying neural networks. However, it can help with the still open task of scalin…
Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis
Jan Křetínský, Alexander Manta, Tobias Meggendorfer
We propose "semantic labelling" as a novel ingredient for solving games in the context of LTL synthesis. It exploits recent advances in the automata-based approach, yielding more i…
Strategy Representation by Decision Trees with Linear Classifiers
Pranav Ashok, Tomáš Brázdil, Krishnendu Chatterjee +3
Graph games and Markov decision processes (MDPs) are standard models in reactive synthesis and verification of probabilistic systems with nondeterminism. The class of -regular w…
Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes
Pranav Ashok, Tomáš Brázdil, Jan Křetínský +1
The maximum reachability probabilities in a Markov decision process can be computed using value iteration (VI). Recently, simulation-based heuristic extensions of VI have been intr…
LTL Store: Repository of LTL formulae from literature and case studies
Jan Křetínský, Tobias Meggendorfer, Salomon Sickert
This continuously extended technical report collects and compares commonly used formulae from the literature and provides them in a machine readable way.