output
20032024
most citedDemystifying Reachability in Vector Addition Systems

88 citations

137 papers

cs.RO2024

Learning Bipedal Walking for Humanoid Robots in Challenging Environments with Obstacle Avoidance

Marwan Hamze, Mitsuharu Morisawa, Eiichi Yoshida

Deep reinforcement learning has seen successful implementations on humanoid robots to achieve dynamic walking. However, these implementations have been so far successful in simple…

cs.CL2023

Weakly synchronous systems with three machines are Turing powerful

Cinzia Di Giusto, Davide Ferré, Etienne Lozes +1

Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate thr…

math.OC2023

Hybrid Persistency of Excitation in Adaptive Estimation for Hybrid Systems

Adnane Saoud, Mohamed Maghenem, Antonio Loría +1

We propose a framework to analyze stability for a class of linear non-autonomous hybrid systems, where the continuous evolution of solutions is governed by an ordinary differential…

cs.LO2020★ 2 cited

Type safety of rewrite rules in dependent types

Frédéric Blanqui

The expressiveness of dependent type theory can be extended by identifying types modulo some additional computation rules. But, for preserving the decidability of type-checking or…

cs.LO2020

Synthesizing safe coalition strategies

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar

Concurrent games with a fixed number of agents have been thoroughly studied, with various solution concepts and objectives for the agents. In this paper, we consider concurrent gam…

cs.LG2020★ 5 cited

Property-Directed Verification of Recurrent Neural Networks

Igor Khmelnitsky, Daniel Neider, Rajarshi Roy +6

This paper presents a property-directed approach to verifying recurrent neural networks (RNNs). To this end, we learn a deterministic finite automaton as a surrogate model from a g…