IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i4p368-d498448.html
   My bibliography  Save this article

A Divide and Conquer Approach to Eventual Model Checking

Author

Listed:
  • Moe Nandi Aung

    (Faculty of Information Science, University of Information Technology (UIT), Hlaing Township, Yangon PO 11052, Myanmar
    These authors contributed equally to this work.)

  • Yati Phyo

    (School of Information Science, Japan Advanced Institite of Science and Technology (JAIST), Nomi, Ishikawa 923-1292, Japan
    These authors contributed equally to this work.)

  • Canh Minh Do

    (School of Information Science, Japan Advanced Institite of Science and Technology (JAIST), Nomi, Ishikawa 923-1292, Japan
    These authors contributed equally to this work.)

  • Kazuhiro Ogata

    (School of Information Science, Japan Advanced Institite of Science and Technology (JAIST), Nomi, Ishikawa 923-1292, Japan
    These authors contributed equally to this work.)

Abstract

The paper proposes a new technique to mitigate the state of explosion in model checking. The technique is called a divide and conquer approach to eventual model checking. As indicated by the name, the technique is dedicated to eventual properties. The technique divides an original eventual model checking problem into multiple smaller model checking problems and tackles each smaller one. We prove a theorem that the multiple smaller model checking problems are equivalent to the original eventual model checking problem. We conducted a case study that demonstrates the power of the proposed technique.

Suggested Citation

  • Moe Nandi Aung & Yati Phyo & Canh Minh Do & Kazuhiro Ogata, 2021. "A Divide and Conquer Approach to Eventual Model Checking," Mathematics, MDPI, vol. 9(4), pages 1-16, February.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:4:p:368-:d:498448
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/4/368/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/4/368/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Virginia Niculescu, 2022. "On Generalizing Divide and Conquer Parallel Programming Pattern," Mathematics, MDPI, vol. 10(21), pages 1-22, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:4:p:368-:d:498448. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.