BIROn - Birkbeck Institutional Research Online

    Polynomial-time algorithms for computing distances of Fuzzy Transition Systems

    Chen, Taolue and Han, Tingting and Cao, Y. (2018) Polynomial-time algorithms for computing distances of Fuzzy Transition Systems. Theoretical Computer Science 727 , pp. 24-36. ISSN 0304-3975.

    [img] Text
    tcs.pdf - Author's Accepted Manuscript
    Restricted to Repository staff only
    Available under License Creative Commons Attribution Non-commercial No Derivatives.

    Download (957kB)
    21449a.pdf - Published Version of Record
    Available under License Creative Commons Attribution.

    Download (866kB) | Preview


    Behaviour distances to measure the resemblance of two states in a (nondeterministic) fuzzy transition system have been proposed recently in literature. Such a distance, defined as a pseudo-ultrametric over the state space of the model, provides a quantitative analogue of bisimilarity. In this paper, we focus on the problem of computing these distances. We first extend the definition of the pseudo-ultrametric by introducing discount such that the discounting factor being equal to 1 captures the original definition. We then provide polynomial-time algorithms to calculate the behavioural distances, in both the non-discounted and the discounted setting. The algorithm is strongly polynomial in the former case.


    Item Type: Article
    Keyword(s) / Subject(s): Fuzzy transition systems, Fuzzy automata, Pseudo-ultrametric, Algorithm
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Research Centres and Institutes: Data Analytics, Birkbeck Institute for
    Depositing User: Dr Tingting Han
    Date Deposited: 02 Mar 2018 13:14
    Last Modified: 17 Jun 2021 21:17


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item