Clovis Eberhart
YOU?
Author Swipe
View article: AP-observation Automata for Abstraction-based Verification of Continuous-time Systems (Extended Version)
AP-observation Automata for Abstraction-based Verification of Continuous-time Systems (Extended Version) Open
A key challenge in abstraction-based verification and control under complex specifications such as Linear Temporal Logic (LTL) is that abstract models retain significantly less information than their original systems. This issue is especia…
View article: Formal Verification of Intersection Safety for Automated Driving
Formal Verification of Intersection Safety for Automated Driving Open
We build on our recent work on formalization of responsibility-sensitive safety (RSS) and present the first formal framework that enables mathematical proofs of the safety of control strategies in intersection scenarios. Intersection scena…
View article: Compositional Probabilistic Model Checking with String Diagrams of MDPs
Compositional Probabilistic Model Checking with String Diagrams of MDPs Open
We present a compositional model checking algorithm for Markov decision processes, in which they are composed in the categorical graphical language of string diagrams. The algorithm computes optimal expected rewards. Our theoretical develo…
View article: Compositional Solution of Mean Payoff Games by String Diagrams
Compositional Solution of Mean Payoff Games by String Diagrams Open
Following our recent development of a compositional model checking algorithm for Markov decision processes, we present a compositional framework for solving mean payoff games (MPGs). The framework is derived from category theory, specifica…
View article: Formal Verification of Safety Architectures for Automated Driving
Formal Verification of Safety Architectures for Automated Driving Open
Safety architectures play a crucial role in the safety assurance of automated\ndriving vehicles (ADVs). They can be used as safety envelopes of black-box ADV\ncontrollers, and for graceful degradation from one ODD to another. Building on\n…
View article: AE for CompMDP
AE for CompMDP Open
This is the artifact of the paper “Compositional Probabilistic Model Checking with String Diagrams of MDPs”.
View article: compMDP-AE
compMDP-AE Open
This is the artifact of the paper “Compositional Probabilistic Model Checking with String Diagrams of MDPs”.
View article: AE for CompMDP
AE for CompMDP Open
This is the artifact of the paper “Compositional Probabilistic Model Checking with String Diagrams of MDPs”.
View article: Compositional Probabilistic Model Checking with String Diagrams of MDPs
Compositional Probabilistic Model Checking with String Diagrams of MDPs Open
We present a compositional model checking algorithm for Markov decision processes, in which they are composed in the categorical graphical language of string diagrams . The algorithm computes optimal expected rewards. Our theoretical devel…
View article: AE for CompMDP
AE for CompMDP Open
This is the artifact of the paper “Compositional Probabilistic Model Checking with String Diagrams of MDPs”.
View article: AE for CompMDP
AE for CompMDP Open
This is the artifact of the paper “Compositional Probabilistic Model Checking with String Diagrams of MDPs”.
View article: Goal-Aware RSS for Complex Scenarios via Program Logic
Goal-Aware RSS for Complex Scenarios via Program Logic Open
International audience
View article: Moment Propagation of Polynomial Systems Through Carleman Linearization for Probabilistic Safety Analysis
Moment Propagation of Polynomial Systems Through Carleman Linearization for Probabilistic Safety Analysis Open
We develop a method to approximate the moments of a discrete-time stochastic polynomial system. Our method is built upon Carleman linearization with truncation. Specifically, we take a stochastic polynomial system with finitely many states…
View article: A Compositional Approach to Parity Games
A Compositional Approach to Parity Games Open
In this paper, we introduce open parity games, which is a compositional\napproach to parity games. This is achieved by adding open ends to the usual\nnotion of parity games. We introduce the category of open parity games, which\nis defined…
View article: Fast Synthesis for Symbolic Self-triggered Control under Right-recursive LTL Specifications
Fast Synthesis for Symbolic Self-triggered Control under Right-recursive LTL Specifications Open
We extend previous work on symbolic self-triggered control for non-deterministic continuous-time nonlinear systems without stability assumptions to a larger class of specifications. Our goal is to synthesise a controller for two objectives…
View article: Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programs
Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programs Open
We present a novel sampling framework for probabilistic programs. The framework combines two recent ideas -- \emph{control-data separation} and \emph{logical condition propagation} -- in a nontrivial manner so that the two ideas boost the …
View article: Hierarchical Sampler for Probabilistic Programs via Separation of Control and Data
Hierarchical Sampler for Probabilistic Programs via Separation of Control and Data Open
We introduce a novel sampling algorithm for Bayesian inference on imperative probabilistic programs. It features a hierarchical architecture that separates control flows from data: the top-level samples a control flow, and the bottom level…
View article: Symbolic Self-triggered Control of Continuous-time Non-deterministic Systems without Stability Assumptions for 2-LTL Specifications
Symbolic Self-triggered Control of Continuous-time Non-deterministic Systems without Stability Assumptions for 2-LTL Specifications Open
We propose a symbolic self-triggered controller synthesis procedure for non-deterministic continuous-time nonlinear systems without stability assumptions. The goal is to compute a controller that satisfies two objectives. The first objecti…
View article: Moment Propagation of Discrete-Time Stochastic Polynomial Systems using Truncated Carleman Linearization
Moment Propagation of Discrete-Time Stochastic Polynomial Systems using Truncated Carleman Linearization Open
We propose a method to compute an approximation of the moments of a discrete-time stochastic polynomial system. We use the Carleman linearization technique to transform this finite-dimensional polynomial system into an infinite-dimensional…
View article: Simple game semantics and Day convolution
Simple game semantics and Day convolution Open
Game semantics has provided adequate models for a variety of programming languages, in which types are interpreted as two-player games and programs as strategies. Melliès (2018) suggested that such categories of games and strategies may be…
View article: Template games, simple games, and Day convolution
Template games, simple games, and Day convolution Open
Game semantics has provided adequate models for a variety of programming languages, in which types are interpreted as two-player games and programs as strategies. Melliès (2018) suggested that such categories of games and strategies may be…
View article: What's in a game? A theory of game models
What's in a game? A theory of game models Open
Game semantics is a rich and successful class of denotational models for programming languages. Most game models feature a rather intuitive setup, yet surprisingly difficult proofs of such basic results as associativity of composition of s…
View article: An intensionally fully-abstract sheaf model for $\pi$ (expanded version)
An intensionally fully-abstract sheaf model for $\pi$ (expanded version) Open
Following previous work on CCS, we propose a compositional model for the $\pi$-calculus in which processes are interpreted as sheaves on certain simple sites. Such sheaves are a concurrent form of innocent strategies, in the sense of Hylan…
View article: An intensionally fully-abstract sheaf model for $π$ (expanded version)
An intensionally fully-abstract sheaf model for $π$ (expanded version) Open
Following previous work on CCS, we propose a compositional model for the $π$-calculus in which processes are interpreted as sheaves on certain simple sites. Such sheaves are a concurrent form of innocent strategies, in the sense of Hyland-…
View article: Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics
Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics Open
Recent developments of game semantics have given rise to new models of concurrent languages. On the one hand, an approach based on string diagrams has given models of CCS and the pi-calculus, and on the other hand, Tsukada and Ong have des…
View article: Game semantics as a singular functor, and definability as geometric realisation
Game semantics as a singular functor, and definability as geometric realisation Open
Game semantics is a class of models of programming languages in which types are interpreted as games and programs as strategies. Though originally designed for sequential languages, its scope has recently been extended to concurrent ones. …
View article: An Intensionally Fully-abstract Sheaf Model for pi
An Intensionally Fully-abstract Sheaf Model for pi Open
Following previous work on CCS, we propose a compositional model for the pi-calculus in which processes are interpreted as sheaves on certain simple sites. We define an analogue of fair testing equivalence in the model and show that our in…