<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-005-10-0633</article-id>
      <article-id pub-id-type="publisher-id">27601</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>F.2.2 - Nonnumerical Algorithms and Problems</subject>
          <subject>G.3 - PROBABILITY AND STATISTICS</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Advanced Fault Tree Modeling</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Schneeweiss</surname>
            <given-names>Winfrid G.</given-names>
          </name>
          <email xlink:type="simple">winfrid.schneeweiss@fernuni-hagen.de</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Computer Engg., Fern University, , Germany</addr-line>
        <institution>Computer Engg., Fern University</institution>
        <country>Germany</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Winfrid G. Schneeweiss (<email xlink:type="simple">winfrid.schneeweiss@fernuni-hagen.de</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>1999</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>10</month>
        <year>1999</year>
      </pub-date>
      <volume>5</volume>
      <issue>10</issue>
      <fpage>633</fpage>
      <lpage>643</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/DBEAAA90-0E73-52BD-8443-004425D9466A">DBEAAA90-0E73-52BD-8443-004425D9466A</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6995728">6995728</uri>
      <permissions>
        <copyright-statement>Winfrid G. Schneeweiss</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Fault trees show which joint components' faults mean system faults. Fault trees can often be used to determine dependability parameters of systems. Here it is shown that i) binary decision diagrams (BDDs) can also be used to calculate system mean failure frequency, ii) modeling dynamics of fault trees does not always mean Markov modeling, iii) a deeper understanding of interrelations between s-dependent components is supported, rather, by Petri nets than by state transition graphs.</p>
      </abstract>
    </article-meta>
  </front>
</article>
