Approximate trace and singleton failures equivalences for transition systems

被引:0
|
作者
Wang, Chao [1 ]
Wu, Jinzhao [2 ]
Tan, Hongyan [3 ]
机构
[1] Beijing Jiaotong Univ, Sch Comp & Informat Technol, Beijing 100044, Peoples R China
[2] Guangxi Univ Nationalities, Guangxi Key Lab Hybrid Computat & IC Design Anal, Nanning 530006, Peoples R China
[3] Chinese Acad Sci, Inst Acoust, Beijing 100190, Peoples R China
基金
中国国家自然科学基金;
关键词
approximate equivalence; trace; singleton failures (SF); transition systems; SEMANTICS; DISCRETE;
D O I
10.1109/JSEE.2015.00096
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Established system equivalences for transition systems, such as trace equivalence and failures equivalence, require the observations to be exactly identical. However, an accurate measurement is impossible when interacting with the physical world, hence exact equivalence is restrictive and not robust. Using Baire metric, a generalized framework of transition system approximation is proposed by developing the notions of approximate language equivalence and approximate singleton failures (SF) equivalence. The framework takes the traditional exact equivalence as a special case. The approximate language equivalence is coarser than the approximate SF equivalence, just like the hierarchy of the exact ones. The main conclusion is that the two approximate equivalences satisfy the transitive property, consequently, they can be successively used in transition system approximation.
引用
收藏
页码:886 / 896
页数:11
相关论文
共 50 条
  • [1] Approximate trace and singleton failures equivalences for transition systems
    Chao Wang
    Jinzhao Wu
    Hongyan Tan
    [J]. Journal of Systems Engineering and Electronics, 2015, 26 (04) : 886 - 896
  • [2] Approximate trace and singleton failures equivalences for event structures
    Li S.-R.
    Wang C.
    [J]. Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2016, 45 (04): : 674 - 683
  • [3] Approximate Reachability and Bisimulation Equivalences for Transition Systems
    王超
    吴尽昭
    谭红艳
    付军
    [J]. Transactions of Tianjin University, 2016, (01) : 19 - 23
  • [4] Approximate Reachability and Bisimulation Equivalences for Transition Systems
    王超
    吴尽昭
    谭红艳
    付军
    [J]. Transactions of Tianjin University, 2016, 22 (01) : 19 - 23
  • [5] Approximate reachability and bisimulation equivalences for transition systems
    Wang C.
    Wu J.
    Tan H.
    Fu J.
    [J]. Transactions of Tianjin University, 2016, 22 (1) : 19 - 23
  • [6] Revised Singleton Failures Equivalence for Labelled Transition Systems
    Wang Chao
    Wu Jinzhao
    Tan Hongyan
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2015, 24 (03) : 498 - 501
  • [7] Revised Singleton Failures Equivalence for Labelled Transition Systems
    WANG Chao
    WU Jinzhao
    TAN Hongyan
    [J]. Chinese Journal of Electronics, 2015, 24 (03) : 498 - 501
  • [8] Approximate Failures Semantics for Polynomial Labelled Transition Systems
    王超
    梁艺
    吴尽昭
    谭红艳
    [J]. Journal of Donghua University(English Edition), 2013, 30 (06) : 472 - 476
  • [9] Approximate failures semantics for polynomial labelled transition systems
    Wang, Chao
    Liang, Yi
    Wu, Jin-Zhao
    Tan, Hong-Yan
    [J]. Journal of Donghua University (English Edition), 2013, 30 (06) : 472 - 476
  • [10] Approximate completed trace equivalence of linear algebra transition systems
    Yang, Hao
    He, Anping
    Zhang, Zhiwei
    Yang, Shihan
    liu, Yang
    [J]. Advances in Intelligent Systems and Computing, 2013, 212 : 233 - 237