88 citations · 339 across the 67 of their papers we have counts for
12 papers · 1 filter
Offline timed pattern matching under uncertainty
Étienne André, Ichiro Hasuo, Masaki Waga
Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log. For example, "a given action is always f…
Fast Falsification of Hybrid Systems using Probabilistically Adaptive Input
Gidon Ernst, Sean Sedwards, Zhenya Zhang +1
We present an algorithm that quickly finds falsifying inputs for hybrid systems, i.e., inputs that steer the system towards violation of a given temporal logic requirement. Our met…
Quantitative Simulations by Matrices
Natsuki Urabe, Ichiro Hasuo
We introduce notions of simulation between semiring-weighted automata as models of quantitative systems. Our simulations are instances of the categorical/coalgebraic notions previo…
Path category for free - Open morphisms from coalgebras with non-deterministic branching
Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata +1
There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span…
Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments
Satoshi Kura, Natsuki Urabe, Ichiro Hasuo
Programs with randomization constructs is an active research topic, especially after the recent introduction of martingale-based analysis methods for their termination and runtimes…
MONAA: A Tool for Timed Pattern Matching with Automata-Based Acceleration
Masaki Waga, Ichiro Hasuo, Kohei Suenaga
We present monaa, a monitoring tool over a real-time property specified by either a timed automaton or a timed regular expression. It implements a timed pattern matching algorithm…