Alleviating State-space Explosion in Component-based Systems with Distributed, Parallel Reachability Analysis Algorithm

03/06/2018
by   Vasumathi K. Narayanan, et al.
0

In this work, we alleviate the well-known State-Space Explosion (SSE) problem in Component Based Systems (CBS). We consider CBS that can be specified as a system of n Communicating Finite State Machines (CFSMs) interacting by rendezvous/handshake method. In order to avoid the SSE incurred by the traditional product machine composition of the given input CFSMs based on interleaving semantics, we construct a sum machine composition based on state-oriented partial-order semantics. The sum machine consists of a set of n unfolded CFSMs. By storing statically, just a small subset of global state vectors at synchronization points, called the synchronous environment vectors and generating the rest of the global-state vectors dynamically on need basis depending on the reachability to be verified, the sum machine alleviates the SSE of the product machine. We demonstrate the implementation of checking the reachability of global state vector from the checking of local reachabilities of the components of the given state vector, through a parallel, distributed algorithm. Parallel and distributed algorithms to generate the sum machine and verifying the reachability in it both without exponential complexity are the contributions of this work. Keywords: interleaving semantics, partial-order semantics, sum machine, product machine, synchronization points, synchronous environment state vectors, reachability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/28/2023

Monus semantics in vector addition systems with states

Vector addition systems with states (VASS) are a popular model for concu...
research
08/21/2023

Weakly synchronous systems with three machines are Turing powerful

Communicating finite-state machines (CFMs) are a Turing powerful model o...
research
08/09/2017

Safety Verification of Phaser Programs

We address the problem of statically checking control state reachability...
research
11/20/2018

FAR-Cubicle - A new reachability algorithm for Cubicle

We present a fully automatic algorithm for verifying safety properties o...
research
04/20/2019

A Compositional Approach for Reliable Adaptation of Track-based Traffic Control Systems at Runtime

In this paper, we propose a compositional approach for verifying autonom...
research
09/22/2020

Asynchronous Distributed Optimization with Randomized Delays

In this work, we study asynchronous finite sum minimization in a distrib...
research
11/17/2018

On Reachability in Parameterized Phaser Programs

We address the problem of statically checking safety properties (such as...

Please sign up or login with your details

Forgot password? Click here to reset