<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    am
   </journal-id>
   <journal-title-group>
    <journal-title>
     Applied Mathematics
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2152-7385
   </issn>
   <issn publication-format="print">
    2152-7393
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/am.2024.158031
   </article-id>
   <article-id pub-id-type="publisher-id">
    am-135160
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Physics 
     </subject>
     <subject>
       Mathematics
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Mathematical Modeling of Possibility Markov Chains by Possibility Theory
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Yoshiki
      </surname>
      <given-names>
       Uemura
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Takemura
      </surname>
      <given-names>
       Kazuhisa
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Kenji
      </surname>
      <given-names>
       Kita
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff3"> 
      <sup>3</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aAnalog Image Technology Development Laboratory, Nara, Japan
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aDepartment of Psychology, Waseda University, Tokyo, Japan
    </addr-line> 
   </aff> 
   <aff id="aff3">
    <addr-line>
     aMILAI Technologies, Inc., Tokushima, Japan
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     06
    </day> 
    <month>
     08
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    15
   </volume> 
   <issue>
    08
   </issue>
   <fpage>
    499
   </fpage>
   <lpage>
    507
   </lpage>
   <history>
    <date date-type="received">
     <day>
      6,
     </day>
     <month>
      July
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      5,
     </day>
     <month>
      July
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      5,
     </day>
     <month>
      August
     </month>
     <year>
      2024
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Statistical regression models are input-oriented estimation models that account for observation errors. On the other hand, an output-oriented possibility regression model that accounts for system fluctuations is proposed. Furthermore, the possibility Markov chain is proposed, which has a disidentifiable state (posterior) and a nondiscriminable state (prior). In this paper, we first take up the entity efficiency evaluation problem as a case study of the posterior non-discriminable production possibility region and mention Fuzzy DEA with fuzzy constraints. Next, the case study of the ex-ante non-discriminable event setting is discussed. Finally, we introduce the measure of the fuzzy number and the equality relation and attempt to model the possibility Markov chain mathematically. Furthermore, we show that under ergodic conditions, the direct sum state can be decomposed and reintegrated using fuzzy OR logic. We had already constructed the Possibility Markov process based on the indifferent state of this world. In this paper, we try to extend it to the indifferent event in another world. It should be noted that we can obtain the possibility transfer matrix by full use of possibility theory.
   </abstract>
   <kwd-group> 
    <kwd>
     Possibility Markov Chain
    </kwd> 
    <kwd>
      Ergodic Condition
    </kwd> 
    <kwd>
      Direct Sum State
    </kwd> 
    <kwd>
      Prior Indiscriminate State
    </kwd> 
    <kwd>
      Posterior Discriminatory State
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>A possibility regression model was proposed by Tanaka et al. Furthermore <xref ref-type="bibr" rid="scirp.135160-1">
     [1]
    </xref>, Sakawa et al. formulated a multi-objective possibility regression model that introduced the concepts of possibility and necessity <xref ref-type="bibr" rid="scirp.135160-2">
     [2]
    </xref>. Typical application considerations include the physical test evaluation problem <xref ref-type="bibr" rid="scirp.135160-3">
     [3]
    </xref> and the entity efficiency evaluation problem <xref ref-type="bibr" rid="scirp.135160-4">
     [4]
    </xref>. For the entity efficiency evaluation problem, a method (Fuzzy DEA) that can simultaneously evaluate both input and output orientation has been proposed <xref ref-type="bibr" rid="scirp.135160-5">
     [5]
    </xref>. In this paper, we first introduce the possibility production function and Fuzzy DEA as examples of possibility (logarithmic) linear models. Next, we take the transition from totalitarianism to democracy, the transition from prewar to postwar, as an interpretation of artificial possibility Markov chains <xref ref-type="bibr" rid="scirp.135160-6">
     [6]
    </xref>-<xref ref-type="bibr" rid="scirp.135160-8">
     [8]
    </xref>. Finally, a simple possibility state transition diagram is used to explain the non-discriminatory event <xref ref-type="bibr" rid="scirp.135160-9">
     [9]
    </xref>. Since the posterior non-discriminatory state <xref ref-type="bibr" rid="scirp.135160-10">
     [10]
    </xref> cannot be represented by a simple possibility state transition diagram, a conceptual diagram of the derivation process for this state is presented <xref ref-type="bibr" rid="scirp.135160-11">
     [11]
    </xref>. It should be noted that the possibility Markov chain of a direct sum fuzzy event under ergodic conditions can be decomposed and reintegrated by applying fuzzy OR logic. From view viewpoint of the probability theory, our study can be regarded as the Markov Chain upon fuzzy/vague event mapped from the state of nature by the membership function <xref ref-type="bibr" rid="scirp.135160-12">
     [12]
    </xref> <xref ref-type="bibr" rid="scirp.135160-13">
     [13]
    </xref>. It should be noted that this possibility Markov Chain has the fuzziness upon fuzzy/vague event. On the other hand, the probability Markov Chain has the fuzziness into the fuzzy buffer.</p>
  </sec><sec id="s2">
   <title>2. Application Considerations for Entity Efficiency Evaluation Problems</title>
   <p>The entity efficiency evaluation problem was once analyzed using Cobb-Douglas type production functions. Subsequently, envelopment analysis methods (e.g. CCR, BCC) were proposed <xref ref-type="bibr" rid="scirp.135160-14">
     [14]
    </xref>. These are input-oriented analysis methods. Subsequently, the possibility production function, that can perform not only input-oriented but also output-oriented analysis at the same time, was considered. Furthermore, a fusion of the envelopment analysis method and the possibility production function was attempted, and it was shown that it is possible to make new considerations. A fusion model of various analytical models of the envelopment analysis method is also discussed <xref ref-type="bibr" rid="scirp.135160-5">
     [5]
    </xref>.</p>
   <p>Focusing on CCR and BCC in the envelopment analysis method, the (posterior) indistinguishable production region can be automatically derived after analyzing each of them separately. First, the posterior indistinguishable production region is specified by fuzzy constraints of a linear function. Next, the fuzzy efficiency is specified by the fuzzy objective of the linear function with the CCR efficiency value and the BCC efficiency value. Finally, by adopting a maximization decision, it becomes an ordinary linear programming problem and the fuzzy optimal efficiency solution can be easily derived <xref ref-type="bibr" rid="scirp.135160-15">
     [15]
    </xref>.</p>
  </sec><sec id="s3">
   <title>3. Case Study of a Possible Markov Chain</title>
   <p>A model in which the transition probability in a normal Markov chain <xref ref-type="bibr" rid="scirp.135160-16">
     [16]
    </xref> is extended to a fuzzy number, and also in which this fuzzy number transitions state as a fuzzy variable over time, is called a possibility Markov chain <xref ref-type="bibr" rid="scirp.135160-17">
     [17]
    </xref> <xref ref-type="bibr" rid="scirp.135160-18">
     [18]
    </xref>. This is also closely related to fuzzy relations and fuzzy graphs <xref ref-type="bibr" rid="scirp.135160-1">
     [1]
    </xref> <xref ref-type="bibr" rid="scirp.135160-2">
     [2]
    </xref>. Let us note that possibility Markov chains have indistinguishable states that occur automatically after the fact and indiscriminate states that can be set subjectively by the decision-maker in advance. For example, as an interpretation, in the Pacific War, confusion (ex-post disidentifiable state) occurred after the war ended, and an artificial policy was taken to set up a non-discriminatory state in advance to gradually transition from totalitarianism to democracy, and sequentially transition the (ex-post) disidentifiable state to a crisp state. This is a buffer allocation problem from a systems science perspective. Let us note that this (ex-ante) non-discriminatory event can be subjectively set up as a triangular possibility distribution using the three-point estimation method. In this paper, in addition to This World, we assume the existence of Other World and Another World for convenience in theoretical considerations <xref ref-type="bibr" rid="scirp.135160-19">
     [19]
    </xref> <xref ref-type="bibr" rid="scirp.135160-20">
     [20]
    </xref>. These Worlds are assumed to be transitive in a possible Markov chain. The boundaries between these Worlds are obviously blurred, Vague Events (State) on the State of Nature <xref ref-type="bibr" rid="scirp.135160-21">
     [21]
    </xref>. For example, the transition from This World to Another World can be acute or chronic. In the acute case, This World and Another World are considered to be a direct sum (note: in fuzzy theory, they are considered to be inversions), and the possibility transition matrix is defined by the possibility principal factor rotation matrix <xref ref-type="bibr" rid="scirp.135160-7">
     [7]
    </xref> <xref ref-type="bibr" rid="scirp.135160-8">
     [8]
    </xref>. On the other hand, in the chronic case, This World and Another World are not a direct sum, and the possibility transition matrix is specified by the possibility skew factor rotation matrix <xref ref-type="bibr" rid="scirp.135160-9">
     [9]
    </xref>. Let us note that in the chronic case, a posteriori indistinguishability condition occurs.</p>
  </sec><sec id="s4">
   <title>4. Mathematical Modeling Efforts for Possibility Markov Chains</title>
   <p>In this chapter, regarding fuzzy state transitions in a possible Markov chain, we focus on the indexes (1), (2), (3), and (4) of the fuzzy numbers and (5), (6), (7), and (8) of the equality relation in the possibility theory to construct a possibility state transition model. Here, the fuzzy events are M and N <xref ref-type="bibr" rid="scirp.135160-20">
     [20]
    </xref>,</p>
   <p>Their possible distribution is, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         μ 
       </mi> 
       <mi>
         M 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         U 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         μ 
       </mi> 
       <mi>
         N 
       </mi> 
      </msub> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         V 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> are.</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <mi>
        O 
      </mi> 
      <mi>
        S 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          ≥ 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≜ 
      </mo> 
      <munder> 
       <mrow> 
        <mi>
          sup 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          U 
        </mi> 
        <mo>
          ≥ 
        </mo> 
        <mi>
          V 
        </mi> 
       </mrow> 
      </munder> 
      <mi>
        min 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           M 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           U 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           N 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           V 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(1)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <mi>
        O 
      </mi> 
      <mi>
        S 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          &gt; 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≜ 
      </mo> 
      <munder> 
       <mrow> 
        <mi>
          sup 
        </mi> 
       </mrow> 
       <mi>
         U 
       </mi> 
      </munder> 
      <munder> 
       <mrow> 
        <mi>
          inf 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          V 
        </mi> 
        <mo>
          ≥ 
        </mo> 
        <mi>
          U 
        </mi> 
       </mrow> 
      </munder> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           M 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           U 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           N 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           V 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(2)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mi>
        E 
      </mi> 
      <mi>
        S 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          ≥ 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≜ 
      </mo> 
      <munder> 
       <mrow> 
        <mi>
          inf 
        </mi> 
       </mrow> 
       <mi>
         U 
       </mi> 
      </munder> 
      <munder> 
       <mrow> 
        <mi>
          sup 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          V 
        </mi> 
        <mo>
          ≤ 
        </mo> 
        <mi>
          U 
        </mi> 
       </mrow> 
      </munder> 
      <mi>
        max 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           M 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           U 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           N 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           V 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(3)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mi>
        E 
      </mi> 
      <mi>
        S 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          &gt; 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≜ 
      </mo> 
      <mn>
        1 
      </mn> 
      <mo>
        − 
      </mo> 
      <munder> 
       <mrow> 
        <mi>
          sup 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          U 
        </mi> 
        <mo>
          ≥ 
        </mo> 
        <mi>
          V 
        </mi> 
       </mrow> 
      </munder> 
      <mi>
        min 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           M 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           U 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           N 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           V 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(4)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <mi>
        O 
      </mi> 
      <mi>
        S 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≜ 
      </mo> 
      <munder> 
       <mrow> 
        <mi>
          sup 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          u 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <msup> 
         <mi>
           R 
         </mi> 
         <mn>
           1 
         </mn> 
        </msup> 
       </mrow> 
      </munder> 
      <mi>
        min 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           M 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           u 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           N 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           u 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(5)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mi>
        E 
      </mi> 
      <mi>
        S 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          ⊂ 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≜ 
      </mo> 
      <munder> 
       <mrow> 
        <mi>
          inf 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          u 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <msup> 
         <mi>
           R 
         </mi> 
         <mn>
           1 
         </mn> 
        </msup> 
       </mrow> 
      </munder> 
      <mi>
        max 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           M 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           u 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           N 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           u 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(6)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mi>
        E 
      </mi> 
      <mi>
        S 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          ⊃ 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≜ 
      </mo> 
      <munder> 
       <mrow> 
        <mi>
          inf 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          u 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <msup> 
         <mi>
           R 
         </mi> 
         <mn>
           1 
         </mn> 
        </msup> 
       </mrow> 
      </munder> 
      <mi>
        max 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           M 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           u 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           μ 
         </mi> 
         <mi>
           N 
         </mi> 
        </msub> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           u 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(7)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mi>
        E 
      </mi> 
      <mi>
        S 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          M 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≜ 
      </mo> 
      <mi>
        min 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          N 
        </mi> 
        <mi>
          E 
        </mi> 
        <mi>
          S 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            M 
          </mi> 
          <mo>
            ⊂ 
          </mo> 
          <mi>
            N 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <mi>
          N 
        </mi> 
        <mi>
          E 
        </mi> 
        <mi>
          S 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            N 
          </mi> 
          <mo>
            ⊂ 
          </mo> 
          <mi>
            M 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>(8)</p>
   <sec id="s4_1">
    <title>4.1. Possible Markov Chain of Direct Sum States</title>
    <p>When fuzzy event M and fuzzy event N are in direct summation, the possibility state transition diagram of the possibility Markov chain is derived as shown in <xref ref-type="fig" rid="fig1">
      Figure 1
     </xref>.</p>
    <fig id="fig1" position="float">
     <label>Figure 1</label>
     <caption>
      <title>Figure 1. Type-1 fuzzy possibility markov chain.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId30.jpeg?20240808041845" />
    </fig>
   </sec>
   <sec id="s4_2">
    <title>4.2. Possibility Markov Chain with Prior Nondiscriminatory State Fe</title>
    <p>The decision maker subjectively specifies the prior nondiscriminatory event Fe in terms of L-R type fuzzy numbers using the 3-point estimation method by lot drawing. After specifying the prior nondiscriminatory event Fe, fuzzy event M and fuzzy event N are automatically identified after the fact to be in direct summation with Fe (<xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>). The possibility state transition diagrams of the posterior possibility Markov chain are shown in <xref ref-type="fig" rid="figFigures 3(a)">
      Figures 3(a)
     </xref> and <xref ref-type="fig" rid="figFigures 3(b)">
      Figures 3(b)
     </xref>. The Type 2 Fuzzy possibility Markov chain is obtained by a two-step transition (<xref ref-type="fig" rid="figFigures 3(c)">
      Figures 3(c)
     </xref>).</p>
    <fig id="fig2" position="float">
     <label>Figure 2</label>
     <caption>
      <title>Figure 2. Prior membership function of nom-discriminable events.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId31.jpeg?20240808041845" />
    </fig>
    <fig-group id="fig3" position="float">
     <fig id="fig3" position="float">
      <label>Figure 3</label>
      <caption>
       <title>(a)--(b)--(c)--Figure 3. (a) Step 1; (b) Step 2; (c) Type 2 fuzzy possibility markov chain.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId32.jpeg?20240808041845" />
     </fig>
     <fig id="fig3" position="float">
      <label>Figure 3</label>
      <caption>
       <title>(a)--(b)--(c)--Figure 3. (a) Step 1; (b) Step 2; (c) Type 2 fuzzy possibility markov chain.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId33.jpeg?20240808041845" />
     </fig>
     <fig id="fig3" position="float">
      <label>Figure 3</label>
      <caption>
       <title>(a)--(b)--(c)--Figure 3. (a) Step 1; (b) Step 2; (c) Type 2 fuzzy possibility markov chain.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId34.jpeg?20240808041845" />
     </fig>
    </fig-group>
    <p>Here, we propose a possible transition from M to Fe followed by a possible transition from Fe to N in two steps. Of course, a straight transition from M to N without Fe is also possible.</p>
   </sec>
   <sec id="s4_3">
    <title>4.3. Possibility Markov Chain with Posterior Indistinguishable State Fe</title>
    <p>The posterior disambiguation state Fe after a given fuzzy event M and fuzzy event N is difficult to draw in a simple possibility state transition diagram because it has a conditional disambiguation state. Here, we show a possibility state transition diagram in which fuzzy event M and fuzzy event N encompass the posterior disidentifiable event Fe using the index of equality relation. First, as shown in <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref>, the posterior disidentifiable event Fe is automatically specified to be a direct sum of fuzzy event N and fuzzy event N with each other.</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Posterior membership function of disdentifiable events.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId35.jpeg?20240808041845" />
    </fig>
    <p>The state transitions of a posteriori disambiguated states are decomposed by zones ((s &lt; 20), (20 ≤ s &lt; 45), (45 ≤ s &lt; 70), (70 ≤ s &lt; 80), (80 ≤ s)) on the natural state S and integrated by a weighted sum over each state transition matrix by the amount of possible information per zone is considered as <xref ref-type="bibr" rid="scirp.135160-10">
      [10]
     </xref>. Thus, using the index of equality relation, the possibility state transition diagrams (<xref ref-type="fig" rid="figFigures 5(a)-(d)">
      Figures 5(a)-(d)
     </xref>) are derived for the posterior indistinguishable states where fuzzy events are not direct sum states in the prior.</p>
    <fig-group id="fig5" position="float">
     <fig id="fig5" position="float">
      <label>Figure 5</label>
      <caption>
       <title>(a)--(b)--(c)--(d)--Figure 5. (a) Type 1 vague possibility markov chain; (b) Step 1; (c) Step 2; (d) Type 2 vague possibility markov chain.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId36.jpeg?20240808041845" />
     </fig>
     <fig id="fig5" position="float">
      <label>Figure 5</label>
      <caption>
       <title>(a)--(b)--(c)--(d)--Figure 5. (a) Type 1 vague possibility markov chain; (b) Step 1; (c) Step 2; (d) Type 2 vague possibility markov chain.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId37.jpeg?20240808041845" />
     </fig>
     <fig id="fig5" position="float">
      <label>Figure 5</label>
      <caption>
       <title>(a)--(b)--(c)--(d)--Figure 5. (a) Type 1 vague possibility markov chain; (b) Step 1; (c) Step 2; (d) Type 2 vague possibility markov chain.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId38.jpeg?20240808041845" />
     </fig>
     <fig id="fig5" position="float">
      <label>Figure 5</label>
      <caption>
       <title>(a)--(b)--(c)--(d)--Figure 5. (a) Type 1 vague possibility markov chain; (b) Step 1; (c) Step 2; (d) Type 2 vague possibility markov chain.</title>
      </caption>
      <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/7405301-rId39.jpeg?20240808041845" />
     </fig>
    </fig-group>
   </sec>
   <sec id="s4_4">
    <title>4.4. Relationship to Buffer Placement Problem</title>
    <p>As shown in the possibility state transition diagram in the previous section, we can see that direct sum state fuzzy events under ergodic conditions can be decomposed and then reintegrated by applying fuzzy OR logic. Let us note that this possibility nondiscriminatory event-setting problem is closely related to the system science buffer allocation problem. In the case of the buffer allocation problem, it has been shown that subsystems may be reintegrated if the rate of variation among the decomposed subsystems is constant <xref ref-type="bibr" rid="scirp.135160-23">
      [23]
     </xref>. Let us note that since the fuzzy events are in direct summation, the area center of gravity of each decomposed fuzzy system does not change from the fuzzy system before decomposition. In the possibility nondiscriminatory event setting problem, the fuzzy events are in direct summation, while in the buffer allocation problem of systems science, the stochastic events are in exclusion. In the mathematical model, the only difference is that the membership function is orthogonal and the sum of the distribution function in a stochastic event. However, if the membership function is considered as a possibility distribution, it is a natural extension of the likelihood function because it can simultaneously consider possibility and necessity. In addition, the ergodic condition is added in this paper to illustrate the mathematical modeling, although it is a strict condition.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Conclusion</title>
   <p>First, the biggest problem with Type 2 possibility Markov chains is that there are cases in which a quadratic transformation is performed without going through a first-order transformation. In this case, we are currently examining whether it is appropriate to simply regard the quadratic transformation as a linear transformation, and just use a Type 1 possibility Markov chain to deal with the situation. The next issue to be addressed in the future is the establishment of a pre-setting method for the non-discriminatory state. Here, the three-point estimation method by lottery is the mainstream method, but note that the three-point estimation method is valid and effective when it is set subjectively under compulsion. Regarding the establishment of a new entity efficiency evaluation method, a method that involves ex-ante non-discriminatory producible regions, as well as ex-post non-discriminatory producible regions, is being devised. Our next research plan is to analyze the Bayesian transition from the ex-post to the ex-ante time series using possibility Markov chains. Finally, an example of application of the possibility Markov chain is the state transition from the Lake Wave Case to the Bay Wave Case. The main purpose of introducing a prior non-discriminatory state is to make the transition smooth. Note that the Type 2 Fuzzy possibility Markov chain corresponds to the steady state (calm) case, while the Type 2 Vague possibility Markov chain corresponds to the state transition in rough seas (stormy). It is very difficult problem to set up the membership function from the state of nature to fuzzy/vague event. We had already constructed “vague sets and theory”. For simplicity, we can set up the membership function by the isosceles triangle. However, using triangular fuzzy numbers for simplicity simplifies the computation and avoids computational complexity. In addition, the method proposed in this study may have potential applications in the control of drones and other vehicles in driving in different environmental worlds, such as deep sea, lakes, and land.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.135160-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tanaka, H. (1990) Fuzzy Modeling and Its Applications. Asakura Shoten. 
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sakawa, M. (1989) Fundamentals and Applications of Fuzzy Theory. Morikita Publishing.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y., Sakawa, M. and Nakawada, T. (1993) Application of Fuzzy Regression Analysis to the Evaluation of Physical Tests. Journal of Japan Society for Fuzzy Theory and Systems, 5, 791-799. &gt;https://doi.org/10.3156/jfuzzy.5.4_791
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. (1997) Satisfactional Method Introducing the Concept of a Fuzzy Goal into DEA. Journal of Japan Society for Fuzzy Theory and Systems, 9, 762-766. &gt;https://doi.org/10.3156/jfuzzy.9.5_762
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. (2006) Fuzzy Decision Making and Fuzzy Statistics. Fukuro Shuppan.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hori Jr., H., Takemura, K. and Matsumoto, Y. (2019) Complex Markov Decision Process. Journal of Fuzzy Mathematics, 27, 957-972.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hori, Y. (2023) Type 2 Fuzzy Stochastic Differential Equations in No-Data Problems and Its Application to Possible Principal Factor Analysis. Journal of Biomedical Fuzzy Systems, 25, 65-69.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hori Jr., H. (2023) Initial and Stopping Condition in Possibility Principal Factor Rotation. Journal of Applied Mathematics and Physics, 11, 1482-1486. &gt;https://doi.org/10.4236/jamp.2023.115097
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hori Jr., H. (2023) Fuzzy-Bayes Decision Making with Reserved Judgment. Journal of Applied Mathematics and Physics, 11, 2783-2788. &gt;https://doi.org/10.4236/jamp.2023.119181
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hori Jr., H. (2024) Many Kinds of Reserved Judgement. Applied Matimaics, 15, 1-8. 
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. and Kita, K. (2024) Proposal of a Possibility Markov Chain with a Posteriori In-Distinguishable and a Priori Nondiscriminative States. Annual Meeting of the Japanese Society for Applied Mathematics, Kyoto, September 2024, 14-16. (In Press)
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Casanova-del-Angel, F., Flores-Méndez, E. and Cortes-Yah, K.G. (2020) Probabilistic Model of Cumulative Damage in Pipelines Using Markov Chains. Journal of Applied Mathematics and Physics, 8, 620-642. &gt;https://doi.org/10.4236/jamp.2020.84048
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hori Jr., H. (2023) Type 2 Possibility Rotation in No-Data Problem. Applied Mathematics, 11, 1482-1486. &gt;https://doi.org/10.4236/jamp.2023.115097
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tone, K. (1993) Measuring and Improving Management Efficiency. JUSE.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y., Kato, K. and Sakawa, M. (2008) A Fuzzy DEA Model and Its Application to Bank Efficiency Evaluation. Proceedings of SCIS&amp;ISIS 2008, Nagoya, September 2008, 959-962.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Takahashi, Y. (2011) Kiyoshi Ito’s Mathematics. Nippon Hyoronsha.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. and Kita, K. (2024) Proc. of Bayes-Fuzzy Estimation with an Application to Analog Wave Equation in No-Data Problem. 2024 2nd International Conference on Robotics, Control and Vision Engineering, Hong Kong, July 2024, 19-21. (In Press)
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. and Kita, K. (2024) Proposal of a Simplified Analog Wave Equation Solution Method by Possibility Theory. Annual Meeting of the Japan Society for Applied Mathematics, Kyoto. (In Press)
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. and Sakawa, M. (1993) Simple Decision Making Method Based on Possibility Distribution of Fuzzy Events: Conference Date, Pages. Journal of the Fuzzy Society of Japan, 5, 528-536.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. (1995) A Normal Possibility Decision Rule. Control and Cybernetics, 24, 103-111.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. (1991) Decision-Making Methods in Fuzzy Events. Journal of the Fuzzy Society of Japan, 3, 123-130.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dubois, D. and Prade, H. (1988) Possibility Theory. Plenum Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.135160-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Uemura, Y. (1985) Study of Buffer Placement in Serial Queueing Systems. Master’s Thesis, Department of Systems Engineering, Graduate School of Engineering, Kobe University.
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>