Please click on one of the flags to reset Reading-Direction if you consider the current setting invalid

Model s quality assurance using MSA and Petri Net

Views  2797
Rating  0

 عباس محسن عبد الحسين البكري
6/20/2011 6:01:58 AM
تصفح هذه الورقة الالكترونية بتقنية Media To Flash Paper

Model s quality assurance using MSA and Petri Net

Dr. Abbas M. Al- Bakry College of Computer Technology, University of Babylon


 This work presents a methodology for designing models in engineering and education fields for verifying the quality assurance conditions.The first model uses matrix structural analysis (MSA) to calculate the expected values for the model. The matrix structural analysis (MSA) uses to design model in engineering field, this helps to expect the values which is the nearest to the real ones. The MSA verify the quality assurance conditions and estimate principles or ad-hoc principles depending on the calculating the actual values. Petri nets uses in another example (Education field). Petri Nets provide a very important feature which is the dynamic property, so the model designing with Petri nets becomes look like as in real.
Key words: Data analysis, Quality management, Petri Net, Matrix Structural analysis.
Data  analysis  is  the  process  of  looking  at  and summarizing data with the intent to extract useful information    and    develop    conclusions[WIKI-EN].   Data analysis can be divided into Exploratory Data Analysis  (EDA)  and  Confirmatory  Data  Analysis (CDA),  where  the  EDA  focuses  on  discovering new features in the data, and CDA on confirming or  falsifying  existing  hypotheses  in  this  paper focuses on CDA as effective tools of building this models .Section 1 provides a brief review on Petri net. section 2 explains the special structure analysis . Section 3 highlight a design of two different models with application to engineering and education. In section 4 discussion and concludes the paper.

A Petri net consists of places, transitions, and directed arcs.  Arcs  run  between  places  and  transitions—not between    places    and    places    or    transitions    and transitions.  The  places  from  which  an  arc  runs  to  a transition are called the input places of the transition; the  places  to  which  arcs  run  from  a  transition  are called the output places of the transition[KOTO84].Places   may   contain   any   number   of   tokens.   A distribution of tokens over the places of a net is called a   marking[ PATA04].   Transitions   act   on   input   tokens   by   a process known as firing.  A  transition  is enabled  if it can  fire,  i.e.,  there  are  tokens  in  every  input  place.  When  a  transition  fires,  it  consumes  the tokens from its  input  places,  performs  some  processing  task,  and places  a  specified  number  of  tokens  into  each  of  its output places. It does this atomically, i.e., in one non- interruptible step. Execution of Petri nets is nondeterministic.  This means two things  [PETE77]: a. multiple  transitions  can  be  enabled  at  the same time, any one of which can fire b. none are required to fire — they fire at will, between time 0 and infinity, or not at all (i.e. it is totally possible that nothing fires at all). Since firing is nondeterministic, Petri nets are well suited  for  modeling  the  concurrent  behavior  of distributed systems.

Dear visitor,For downloading the full version of the research/article click on the pdf icon above.

  • وصف الــ Tags لهذا الموضوع
  • Model s quality assurance using MSA and Petri Net