Search Results for author:
Found 10 papers, 5 papers with code
Probabilistic Black-Box Checking via Active MDP Learning
Our method, ProbBBC, refines the conventional BBC approach by (1) employing an active Markov Decision Process (MDP) learning method during the learning phase, (2) incorporating probabilistic model checking in the synthesis phase, and (3) applying statistical hypothesis testing in the validation phase.
BOREx: Bayesian-Optimization--Based Refinement of Saliency Map for Image- and Video-Classification Models
We propose a new black-box method BOREx (Bayesian Optimization for Refinement of visual model Explanation) to refine a heat map produced by any method.
Dynamic Shielding for Reinforcement Learning in Black-Box Environments
The dynamic shielding technique constructs an approximate system model in parallel with RL using a variant of the RPNI algorithm and suppresses undesired explorations due to the shield constructed from the learned model.
Model-bounded monitoring of hybrid systems
Monitoring of hybrid systems attracts both scientific and practical attention.
Genetic Algorithm for the Weight Maximization Problem on Weighted Automata
In this work, we propose, implement and evaluate a metaheuristic based on genetic algorithms to approximate solutions to the WMP.
Online Quantitative Timed Pattern Matching with Semiring-Valued Weighted Automata
This is the first quantitative and online timed pattern matching algorithm to the best of our knowledge.
Formal Languages and Automata Theory
Symbolic Monitoring against Specifications Parametric in Time and Data
Monitoring consists in deciding whether a log meets a given specification.
Formal Languages and Automata Theory Systems and Control
Weighted Automata Extraction from Recurrent Neural Networks via Regression on State Spaces
We present a method to extract a weighted finite automaton (WFA) from a recurrent neural network (RNN).
Online Parametric Timed Pattern Matching with Automata-Based Skipping
Timed pattern matching has strong connections with monitoring real-time systems.
Formal Languages and Automata Theory
Offline timed pattern matching under uncertainty
Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log.
Systems and Control Logic in Computer Science F.4
