88 citations · 339 across the 67 of their papers we have counts for
Showing 2018 · cs.FLShow all
3 papers · 2 filters
cs.FL2018★ 2 cited
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…
cs.FL2018★ 9 cited
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…
cs.FL2018★ 7 cited
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…