1 code implementation • 28 May 2023 • Zhenya Zhang, Jie An, Paolo Arcaini, Ichiro Hasuo
The classic STL monitoring is performed by computing a robustness interval that specifies, at each instant, how far the monitored signals are from violating and satisfying the specification.
no code implementations • 27 Jul 2022 • Masaki Waga, Ezequiel Castellano, Sasinee Pruekprasert, Stefan Klikovits, Toru Takisaka, Ichiro Hasuo
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.
no code implementations • 11 May 2021 • Mayuko Kori, Ichiro Hasuo, Shin-ya Katsumata
The coincidence between initial algebras (IAs) and final coalgebras (FCs) is a phenomenon that underpins various important results in theoretical computer science.
no code implementations • 15 Feb 2021 • Masaki Waga, Étienne André, Ichiro Hasuo
Monitoring of hybrid systems attracts both scientific and practical attention.
no code implementations • 5 Jan 2021 • Ichiro Hasuo, Yuichiro Oyabu, Clovis Eberhart, Kohei Suenaga, Kenta Cho, Shin-ya Katsumata
We present a novel sampling framework for probabilistic programs.
no code implementations • 26 Nov 2020 • Sanghwa Lee, Jaeyoung Lee, Ichiro Hasuo
Prioritized experience replay (PER) samples important transitions, rather than uniformly, to improve the performance of a deep reinforcement learning agent.
1 code implementation • 11 Apr 2020 • Elena Gutiérrez, Takamasa Okudono, Masaki Waga, Ichiro Hasuo
In this work, we propose, implement and evaluate a metaheuristic based on genetic algorithms to approximate solutions to the WMP.
1 code implementation • 11 May 2019 • Masaki Waga, Étienne André, Ichiro Hasuo
Monitoring consists in deciding whether a log meets a given specification.
Formal Languages and Automata Theory Systems and Control
no code implementations • 5 Apr 2019 • Takamasa Okudono, Masaki Waga, Taro Sekiyama, Ichiro Hasuo
We present a method to extract a weighted finite automaton (WFA) from a recurrent neural network (RNN).
1 code implementation • 21 Dec 2018 • É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.
Systems and Control Logic in Computer Science F.4
1 code implementation • 11 Dec 2018 • Gidon Ernst, Sean Sedwards, Zhenya Zhang, Ichiro Hasuo
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.
Systems and Control
1 code implementation • 16 Nov 2018 • Satoshi Kura, Natsuki Urabe, Ichiro Hasuo
To this goal, we devise a theory of supermartingales that overapproximate higher moments of runtime.
Logic in Computer Science
no code implementations • 8 Sep 2017 • Takumi Akazaki, Yoshihiro Kumazawa, Ichiro Hasuo
Falsification is drawing attention in quality assurance of heterogeneous systems whose complexities are beyond most verification techniques' scalability.
no code implementations • 2 Nov 2015 • Ichiro Hasuo, Shunsuke Shimizu, Corina Cirstea
In the context of formal verification in general and model checking in particular, parity games serve as a mighty vehicle: many problems are encoded as parity games, which are then solved by the seminal algorithm by Jurdzinski.
Logic in Computer Science Programming Languages
no code implementations • 28 Dec 2014 • Bob Coecke, Ichiro Hasuo, Prakash Panangaden
The first QPL under the new name Quantum Physics and Logic was held in Reykjavik (2008), followed by Oxford (2009 and 2010), Nijmegen (2011), Brussels (2012) and Barcelona (2013).