Open AccessRevised Singleton Failures Equivalence for Labelled Transition Systems
Author(s) -
Wang Chao,
Wu Jinzhao,
Tan Hongyan
Publication year - 2015
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2015.07.010
Subject(s) - singleton , equivalence (formal languages) , mathematics , set (abstract data type) , combinatorics , discrete mathematics , computer science , pregnancy , genetics , biology , programming language
Based on previous researches, the set of all traces and Single ton failures (SF) pairs is used to characterize SF equivalence. Since the trace information can not be obtained from the SF information, the set of all SF pairs alone can not characterize SF equivalence. We propose a Revised version of single ton failures (RSF) pair, show that the set of all RSF pairs alone can characterize SF equivalence, RSF equivalence and SF equivalence are equivalent, and discuss the difference between RSF and SF. The main conclusion of this paper is that RSF equivalence algorithmis the most efficient one among all SF equivalence algorithms. We present several examples showing RSF equivalence algorithm is computationally quite efficient.