Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Eric Goubault"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 4 (2022)
We extend the formalisation of confluence results in Kleene algebras to a formalisation of coherent confluence proofs. For this, we introduce the structure of higher globular Kleene algebra, a higher-dimensional generalisation of modal and concurrent
Externí odkaz:
https://doaj.org/article/0a53cf6d1ce14baa98c252946e41df48
Autor:
Eric Goubault, Samuel Mimram
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 3 (2020)
A semantics of concurrent programs can be given using precubical sets, in order to study (higher) commutations between the actions, thus encoding the "geometry" of the space of possible executions of the program. Here, we study the particular case of
Externí odkaz:
https://doaj.org/article/4e0526aac4c64595a6f402c15068f2bc
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 257, Iss Proc. FVAV 2017, Pp 91-104 (2017)
We formally verify a hybrid control law designed to perform a station keeping maneuver for a planar vehicle. Such maneuver requires that the vehicle reaches a neighborhood of its station in finite time and remains in it while waiting for further inst
Externí odkaz:
https://doaj.org/article/622cb1a956df48b3b83919ae69aef3ea
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 1 (2012)
We introduce a new domain for finding precise numerical invariants of programs by abstract interpretation. This domain, which consists of level sets of non-linear functions, generalizes the domain of linear "templates" introduced by Manna, Sankaranar
Externí odkaz:
https://doaj.org/article/9fdf31bf6ead4b6fbfae087ae8d8d8a3
Publikováno v:
IEEE Control Systems Letters. 6:638-643
This letter presents an approach to over-approximate the reachable set of states of a system whose uncertainties are arbitrarily time-varying. Most approaches generally assume piecewise continuity or sometimes Riemann-integrability of the uncertainti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e2b9f27d762268873a141b19e2415b3
https://doi.org/10.1109/lcsys.2021.3084530
https://doi.org/10.1109/lcsys.2021.3084530
Publikováno v:
IEEE Transactions on Automatic Control. :1-16
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c71ba68afb5dcfad38e88b70413450db
https://doi.org/10.1109/tac.2022.3217260
https://doi.org/10.1109/tac.2022.3217260
Publikováno v:
OCEANS 2022, Hampton Roads.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1245de8901ffbf868513554f5f30217e
https://doi.org/10.1109/oceans47191.2022.9977121
https://doi.org/10.1109/oceans47191.2022.9977121
Publikováno v:
2022 6th International Conference on Automation, Control and Robots (ICACR).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f350e828d9f8040de5eb902865d4946
https://doi.org/10.1109/icacr55854.2022.9935523
https://doi.org/10.1109/icacr55854.2022.9935523
Autor:
Eric Goubault, Sylvie Putot
Publikováno v:
ADHS
We consider the problem of under and over-approximating the image of general vector-valued functions over bounded sets, and apply the proposed solution to the estimation of reachable sets of uncertain non-linear discrete-time dynamical systems. Such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ca8802bc29d73e0a9ef7bc07d1ea5a5
https://doi.org/10.1016/j.ifacol.2021.08.504
https://doi.org/10.1016/j.ifacol.2021.08.504
Autor:
Eric Goubault, Sylvie Putot
Publikováno v:
Computer Aided Verification ISBN: 9783031131844
We present a unified approach, implemented in the RINO tool, for the computation of inner and outer-approximations of reachable sets of discrete-time and continuous-time dynamical systems, possibly controlled by neural networks with differentiable ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbf2ff625bbb0f1c1f22b56fd3dc7962
https://doi.org/10.1007/978-3-031-13185-1_25
https://doi.org/10.1007/978-3-031-13185-1_25
