English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this work, we alleviate the well-known State-Space Explosion (SSE) problemin Component Based Systems (CBS). We consider CBS that can be specified as asystem of n Communicating Finite State Machines (CFSMs) interacting byrendezvous/handshake method. In order to avoid the SSE incurred by thetraditional product machine composition of the given input CFSMs based oninterleaving semantics, we construct a sum machine composition based onstate-oriented partial-order semantics. The sum machine consists of a set of nunfolded CFSMs. By storing statically, just a small subset of global statevectors at synchronization points, called the synchronous environment vectorsand generating the rest of the global-state vectors dynamically on need basisdepending on the reachability to be verified, the sum machine alleviates theSSE of the product machine. We demonstrate the implementation of checking thereachability of global state vector from the checking of local reachabilitiesof the components of the given state vector, through a parallel, distributedalgorithm. Parallel and distributed algorithms to generate the sum machine andverifying the reachability in it both without exponential complexity are thecontributions of this work. Keywords: interleaving semantics, partial-ordersemantics, sum machine, product machine, synchronization points, synchronousenvironment state vectors, reachability.

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