88 citations · 339 across the 67 of their papers we have counts for
10 papers · 1 filter
Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
Takamasa Okudono, Masaki Waga, Taro Sekiyama +1
Active learning of finite automata has been vigorously pursued for the purposes of analysis and explanation of black-box systems. In this paper, we study an L*-style learning algor…
Explicit Hopcroft's Trick in Categorical Partition Refinement
Takahiro Sanada, Ryota Kojima, Yuichi Komorida +2
Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those…
Exemplifying parametric timed specifications over signals with bounded behavior
Étienne André, Masaki Waga, Natsuki Urabe +1
Specifying properties can be challenging work. In this paper, we propose an automated approach to exemplify properties given in the form of automata extended with timing constraint…
Symbolic Monitoring against Specifications Parametric in Time and Data
Masaki Waga, Étienne André, Ichiro Hasuo
Monitoring consists in deciding whether a log meets a given specification. In this work, we propose an automata-based formalism to monitor logs in the form of actions associated wi…
Parametric Timed Pattern Matching
Masaki Waga, Étienne André, Ichiro Hasuo
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…
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…
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…
Moore-Machine Filtering for Timed and Untimed Pattern Matching
Masaki Waga, Ichiro Hasuo
Monitoring is an important body of techniques in runtime verification of real-time, embedded, and cyber-physical systems. Mathematically, the monitoring problem can be formalized a…
Efficient Online Timed Pattern Matching by Automata-Based Skipping
Masaki Waga, Ichiro Hasuo, Kohei Suenaga
The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log and a specification $\math…
A Boyer-Moore Type Algorithm for Timed Pattern Matching
Masaki Waga, Takumi Akazaki, Ichiro Hasuo
The timed pattern matching problem is formulated by Ulus et al. and has been actively studied since, with its evident application in monitoring real-time systems. The problem takes…