88 citations · 339 across the 67 of their papers we have counts for
7 papers · 1 filter
Formal Verification of Safety Architectures for Automated Driving
Clovis Eberhart, Jérémy Dubut, James Haydon +1
Safety architectures play a crucial role in the safety assurance of automated driving vehicles (ADVs). They can be used as safety envelopes of black-box ADV controllers, and for gr…
Formal Verification of Intersection Safety for Automated Driving
James Haydon, Martin Bondu, Clovis Eberhart +2
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 contr…
Compositional Probabilistic Model Checking with String Diagrams of MDPs
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada +1
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 algorith…
Compositional Solution of Mean Payoff Games by String Diagrams
Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada +1
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…
Exploiting Adjoints in Property Directed Reachability Analysis
Mayuko Kori, Flavio Ascari, Filippo Bonchi +3
We formulate, in lattice-theoretic terms, two novel algorithms inspired by Bradley's property directed reachability algorithm. For finding safe invariants or counterexamples, the f…
Explicit Hopcroft's Trick in Categorical Partition Refinement
Takahiro Sanada, Ryota Kojima, Yuichi Komorida +2
Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those…