An improved search strategy for lossy channel systems

P. A. Abdulla, M. Kindahl, D. Peled

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In [1] we considered lossy channel systems which are a particular class of infinite state systems consisting of finite state processes communicating through channels that are unbounded and unreliable. We presented a backward reachability algorithm which, starting from a set of “bad” states, checks whether there is a backward path to the initial state of the system. Using standard techniques, the reachability algorithm can be used to check safety properties for lossy channel systems. In this paper we adopt partial order techniques to improve the algorithm in [1]. We define a preorder, which we call the better than relation,among the set of transitions of the system. Intuitively a transition is better than another if choosing the first transition instead of the second preserves the reachability of the initial state during the analysis. This relation is weaker than the independence relation, which is an equivalence relation, used in traditional partial order methods, in the sense that two transitions are independent if and only if each of them is better than the other. Consequently, our method gives a better reduction in the number of states considered during the analysis. We demonstrate the efficiency of the approach by a number of experimental results.
Original languageAmerican English
Title of host publicationFormal Description Techniques and Protocol Specification, Testing and Verification
EditorsTadanori Mizuno, Norio Shiratori, Teruo Higashino, Atsushi Togashi
PublisherSpringer US
StatePublished - 1997

Bibliographical note

Place of conference:Osaka, Japan

Fingerprint

Dive into the research topics of 'An improved search strategy for lossy channel systems'. Together they form a unique fingerprint.

Cite this