Safety architectures play a crucial role in the safety assurance of auto...
We build on our recent work on formalization of responsibility-sensitive...
We present a compositional model checking algorithm for Markov decision
...
Following our recent development of a compositional model checking algor...
We formulate, in lattice-theoretic terms, two novel algorithms inspired ...
Online monitoring is an effective validation approach for hybrid systems...
It is challenging to use reinforcement learning (RL) in cyber-physical
s...
We introduce a goal-aware extension of responsibility-sensitive safety (...
Responsibility-sensitive safety (RSS) is an approach to the safety of
au...
We present LT-PDR, a lattice-theoretic generalization of Bradley's prope...
Specifying properties can be challenging work. In this paper, we propose...
In this paper, we introduce open parity games, which is a compositional
...
Formal reasoning on the safety of controller systems interacting with pl...
We introduce a new logic named Quantitative Confidence Logic (QCL) that
...
A modal logic that is strong enough to fully characterize the behavior o...
The coincidence between initial algebras (IAs) and final coalgebras (FCs...
We present a novel decision tree-based synthesis algorithm of ranking
fu...
Monitoring of hybrid systems attracts both scientific and practical
atte...
We introduce a novel sampling algorithm for Bayesian inference on impera...
Prioritized experience replay (PER) samples important transitions, rathe...
Solving stochastic games with the reachability objective is a fundamenta...
The weight maximization problem (WMP) is the problem of finding the word...
Bisimilarity as an equivalence notion of systems has been central to pro...
We present a method to extract a weighted finite automaton (WFA) from a
...
In the field of quality assurance of hybrid systems (that combine contin...
Given a log and a specification, timed pattern matching aims at exhibiti...
Programs with randomization constructs is an active research topic,
espe...
We introduce notions of simulation between semiring-weighted automata as...
We introduce notions of simulation between semiring-weighted automata as...
We investigate a canonical way of defining bisimilarity of systems when ...
Computing reachability probabilities is a fundamental problem in the ana...
Computing reachability probabilities is a fundamental problem in the ana...
Categorical studies of recursive data structures and their associated
re...
Falsification is drawing attention in quality assurance of heterogeneous...
This volume contains the proceedings of the 11th International Workshop ...