• DocumentCode
    3295408
  • Title

    An Optimize Algorithm for Path Probabilities in Stochastic Process Algebras

  • Author

    Zhao, Xiyng

  • Author_Institution
    Software Eng. Dept., Lanzhou Polytech. Coll., Lanzhou
  • Volume
    1
  • fYear
    2008
  • fDate
    18-20 Oct. 2008
  • Firstpage
    51
  • Lastpage
    55
  • Abstract
    Nondeterminism in a stochastic process algebras (SPA) is resolved by a scheduler. For given scheduler D and a starting state, D induces a stochastic process MD on an SPA M. In this paper, by definition the path probability and using dynamic programming method of mathematic on a induced stochastic process algebras MD, we give an algorithm to compute the optimize path probability to reach a set of goal states within a time bound on SPA from the start state s0 and analysis the complexity of our algorithm.
  • Keywords
    dynamic programming; probability; process algebra; stochastic processes; dynamic programming method; induced stochastic process algebras; nondeterminism; optimize algorithm; path probability; scheduler; Algebra; Concurrent computing; Educational institutions; Exponential distribution; Performance analysis; Processor scheduling; Scheduling algorithm; Software algorithms; Software engineering; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation, 2008. ICNC '08. Fourth International Conference on
  • Conference_Location
    Jinan
  • Print_ISBN
    978-0-7695-3304-9
  • Type

    conf

  • DOI
    10.1109/ICNC.2008.316
  • Filename
    4666809
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3295408