IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v29y2018i4d10.1007_s10845-015-1143-4.html
   My bibliography  Save this article

Probabilistic Boolean network modeling of an industrial machine

Author

Listed:
  • Pedro J. Rivera Torres

    (ETSET-Universidade de Vigo)

  • E. I. Serrano Mercado

    (Polytechnic University of Puerto Rico)

  • Luis Anido Rifón

    (ETSET-Universidade de Vigo)

Abstract

Theoretical modeling of manufacturing processes assists the design of new systems for predictions of future behavior, identifies improvement areas, and evaluates changes to existing systems. A novel approach is proposed to model industrial machines using probabilistic Boolean networks (PBNs) to study the relationship between machine components, their reliability and function. Once a machine is modeled as a PBN, through identification of regulatory nodes, predictors and selection probabilities, simulation and property verification are used to verify model correctness and behavior. Using real machine data, model parameters are estimated and a PBN is built to describe the machine, and formulate valid predictions about probability of failure through time. Two models were established: one with non-deterministic inputs (proposed), another with components’ MTBFs inputs. Simulations were used to generate data required to conduct inferential statistical tests to determine the level of correspondence between predictions and real machine data. An ANOVA test shows no difference between expected and observed values of the two models (p value = 0.208). A two-sample T test demonstrates the proposed model provides values closer to expected values; consequently, it can model observable phenomena (p value $$=$$ = 0.000). Simulations are used to generate data required to conduct inferential statistical tests to determine the level of correspondence between model prediction and real machine data. This research demonstrates that using PBNs to model manufacturing systems provides a new mechanism for the study and prediction of their future behavior at the design phase, assess future performance and identify areas to improve design reliability and system resilience.

Suggested Citation

  • Pedro J. Rivera Torres & E. I. Serrano Mercado & Luis Anido Rifón, 2018. "Probabilistic Boolean network modeling of an industrial machine," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 875-890, April.
  • Handle: RePEc:spr:joinma:v:29:y:2018:i:4:d:10.1007_s10845-015-1143-4
    DOI: 10.1007/s10845-015-1143-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-015-1143-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10845-015-1143-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Desheng Zheng & Guowu Yang & Xiaoyu Li & Zhicai Wang & Feng Liu & Lei He, 2013. "An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks," PLOS ONE, Public Library of Science, vol. 8(4), pages 1-7, April.
    2. Claudine Chaouiya & Ouerdia Ourrad & Ricardo Lima, 2013. "Majority Rules with Random Tie-Breaking in Boolean Gene Regulatory Networks," PLOS ONE, Public Library of Science, vol. 8(7), pages 1-14, July.
    3. Wensheng Guo & Guowu Yang & Wei Wu & Lei He & Mingyu Sun, 2014. "A Parallel Attractor Finding Algorithm Based on Boolean Satisfiability for Genetic Regulatory Networks," PLOS ONE, Public Library of Science, vol. 9(4), pages 1-10, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Changki Hong & Jeewon Hwang & Kwang-Hyun Cho & Insik Shin, 2015. "An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-19, December.
    2. Pedro J. Rivera Torres & Eileen I. Serrano Mercado & Orestes Llanes Santiago & Luis Anido Rifón, 2018. "Modeling preventive maintenance of manufacturing processes with probabilistic Boolean networks with interventions," Journal of Intelligent Manufacturing, Springer, vol. 29(8), pages 1941-1952, December.
    3. Floriani, Elena & Lima, Ricardo & Ourrad, Ouerdia & Spinelli, Lionel, 2016. "Flux through a Markov chain," Chaos, Solitons & Fractals, Elsevier, vol. 93(C), pages 136-146.
    4. Sara D. Cardell & Amparo Fúster-Sabater, 2019. "Binomial Representation of Cryptographic Binary Sequences and Its Relation to Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-13, March.
    5. Luboš Brim & Samuel Pastva & David Šafránek & Eva Šmijáková, 2021. "Parallel One-Step Control of Parametrised Boolean Networks," Mathematics, MDPI, vol. 9(5), pages 1-16, March.

    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:spr:joinma:v:29:y:2018:i:4:d:10.1007_s10845-015-1143-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.