Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (3)
  • Open Access

    ARTICLE

    Computation Tree Logic Model Checking of Multi-Agent Systems Based on Fuzzy Epistemic Interpreted Systems

    Xia Li1, Zhanyou Ma1,*, Zhibao Mian2, Ziyuan Liu1, Ruiqi Huang1, Nana He1

    CMC-Computers, Materials & Continua, Vol.78, No.3, pp. 4129-4152, 2024, DOI:10.32604/cmc.2024.047168

    Abstract Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications. Although there is an extensive literature on qualitative properties such as safety and liveness, there is still a lack of quantitative and uncertain property verifications for these systems. In uncertain environments, agents must make judicious decisions based on subjective epistemic. To verify epistemic and measurable properties in multi-agent systems, this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge (FCTLK). We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy… More >

  • Open Access

    ARTICLE

    Identifying Counterexamples Without Variability in Software Product Line Model Checking

    Ling Ding1, Hongyan Wan2,*, Luokai Hu1, Yu Chen1

    CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 2655-2670, 2023, DOI:10.32604/cmc.2023.035542

    Abstract Product detection based on state abstraction technologies in the software product line (SPL) is more complex when compared to a single system. This variability constitutes a new complexity, and the counterexample may be valid for some products but spurious for others. In this paper, we found that spurious products are primarily due to the failure states, which correspond to the spurious counterexamples. The violated products correspond to the real counterexamples. Hence, identifying counterexamples is a critical problem in detecting violated products. In our approach, we obtain the violated products through the genuine counterexamples, which have no failure state, to avoid… More >

  • Open Access

    ARTICLE

    Applying Probabilistic Model Checking to Path Planning in an Intelligent Transportation System Using Mobility Trajectories and Their Statistical Data

    Honghao Gao1, 2, 5, Wanqiu Huang1, 4, Xiaoxian Yang3

    Intelligent Automation & Soft Computing, Vol.25, No.3, pp. 547-559, 2019, DOI:10.31209/2019.100000110

    Abstract Path planning is an important topic of research in modern intelligent traffic systems (ITSs). Traditional path planning methods aim to identify the shortest path and recommend this path to the user. However, the shortest path is not always optimal, especially in emergency rescue scenarios. Thus, complex and changeable factors, such as traffic congestion, road construction and traffic accidents, should be considered when planning paths. To address this consideration, the maximum passing probability of a road is considered the optimal condition for path recommendation. In this paper, the traffic network is abstracted as a directed graph. Probabilistic data on traffic flow… More >

Displaying 1-10 on page 1 of 3. Per Page