Benchmarks of Extended Basis Reachability Graphs

11/19/2021
by   Yin Tong, et al.
0

In this note, we want to provide a comparison among the efficiency of different approaches for the verification of K-step and infinite-step opacity based on three different graphs: the Extended Basis Reachability Graph (EBRG), the Basis Reachability Graph (BRG) when applicable, and the Reachability Graph (RG).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2023

Reachability in 3-VASS is in Tower

The reachability problem for vector addition systems with states (VASS) ...
research
03/13/2020

Reachability is Tower Complete

A complete characterization of the complexity of the reachability proble...
research
04/27/2020

Dynamic complexity of Reachability: How many changes can we handle?

In 2015, it was shown that reachability for arbitrary directed graphs ca...
research
05/13/2020

FlowCFL: A Framework for Type-based Reachability Analysis in the Presence of Mutable Data

Reachability analysis is a fundamental program analysis with a wide vari...
research
12/13/2018

VASS reachability in three steps

This note is a product of digestion of the famous proof of decidability ...
research
04/01/2022

Traversability, Reconfiguration, and Reachability in the Gadget Framework

Consider an agent traversing a graph of "gadgets", each with local state...
research
09/07/2017

ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems

We present the ParaPlan tool which provides the reachability analysis of...

Please sign up or login with your details

Forgot password? Click here to reset