Hierarchy-based incremental analysis of communication protocols

Abstract

In this paper we present an incremental strategy for reachability analysis of communication protocols modeled as sets of communicating finite state machines (CFSMs) with synchronous communication and direct naming. A set of CFSMs i s organized into a hierarchy. We present an algorithm that, for a given hierarchy of a set M of CFSMs, incrementally composes and reduces subsets of CFSMs in M and finally produces a minimum CFSM describing the ezternal behavior of M . We also show that this incremental reachability analysis guarantees the detection of global deadlocks. We provide an algorithm .for selecting a hierarchy for a set of CFSMs and report some empirical results.

Reduction and Abstraction Techniques for BIP

“…Several heuristics for selecting candidate components have been presented for LTS systems with no data transfer [19,9,10]. These heuristics consider merging pairs of components and favor the ones that result in smaller components.…”

“…Much work has been done on the automatic compositional reduction of communicating processes [1,10,9,19]. The techniques revolve around incrementally composing and minimizing individual components of an input system modulo an equivalence relation.…”

“…The first is proposed in [19] and aims at finding components such that the number of transitions that can be removed (hidden) after their parallel composition is as high as possible. The authors in [9] improve on the heuristics defined in [19] by introducing metrics to estimate the number of the transitions that can be removed after parallel composition. Our transformations can make use of the aforementioned heuristics to select candidate components for merging.…”

“…Given a BIP system consisting of several atomic components, our method automatically selects a pair of candidate components that have a high reduction potential based on their data dependencies and their synchronization. Our methods uses component selection heuristics similar to [19,9,10] and provides a user-defined selection API. Then, our method computes the product of the selected pair of atomic components which renders the interaction data transfer operations into transition data transfer operations.…”

Refined Interfaces for Compositional Verification

“…In its simplest forms [10,28,32,38,33,34,36,31], compositional verification (also called incremental reduction [32], incremental reachability analysis [33,34], compositional state space generation [36], or inductive compression [31]) consists in replacing each sequential process by an abstraction, simpler than the original process but still preserving the properties to be verified on the whole system. Quite often, abstracting a process is done by minimizing its corresponding Lts modulo an appropriate equivalence or preorder relation (e.g., a bisimulation relation, such as strong, branching, or observational equivalence).…”