IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v148y2003i2p436-451.html
   My bibliography  Save this article

Lumpable continuous-time stochastic automata networks

Author

Listed:
  • Gusak, Oleg
  • Dayar, Tugrul
  • Fourneau, Jean-Michel

Abstract

No abstract is available for this item.

Suggested Citation

  • Gusak, Oleg & Dayar, Tugrul & Fourneau, Jean-Michel, 2003. "Lumpable continuous-time stochastic automata networks," European Journal of Operational Research, Elsevier, vol. 148(2), pages 436-451, July.
    • Handle: RePEc:eee:ejores:v:148:y:2003:i:2:p:436-451
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00431-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Stewart, William J. & Atif, Karim & Plateau, Brigette, 1995. "The numerical solution of stochastic automata networks," European Journal of Operational Research, Elsevier, vol. 86(3), pages 503-525, November.
    2. Uysal, Ertugrul & Dayar, Tugrul, 1998. "Iterative methods based on splittings for stochastic automata networks," European Journal of Operational Research, Elsevier, vol. 110(1), pages 166-186, October.
    3. Peter Buchholz & Gianfranco Ciardo & Susanna Donatelli & Peter Kemper, 2000. "Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 203-222, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Oliveira, Fernando S., 2010. "Limitations of learning in automata-based systems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 684-691, June.

    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. Amy N. Langville & William J. Stewart, 2004. "Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 300-315, August.
    2. Peter Buchholz & Gianfranco Ciardo & Susanna Donatelli & Peter Kemper, 2000. "Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 203-222, August.
    3. Oliveira, Fernando S., 2010. "Limitations of learning in automata-based systems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 684-691, June.
    4. Abderezak Touzene, 2008. "A Tensor Sum Preconditioner for Stochastic Automata Networks," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 234-242, May.
    5. Uysal, Ertugrul & Dayar, Tugrul, 1998. "Iterative methods based on splittings for stochastic automata networks," European Journal of Operational Research, Elsevier, vol. 110(1), pages 166-186, October.
    6. Å nipas, Mindaugas & Radziukynas, Virginijus & ValakeviÄ ius, Eimutis, 2017. "Modeling reliability of power systems substations by using stochastic automata networks," Reliability Engineering and System Safety, Elsevier, vol. 157(C), pages 13-22.
    7. Peter Buchholz & Miklós Telek, 2013. "Rational Automata Networks: A Non-Markovian Modeling Approach," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 87-101, February.
    8. Å nipas, Mindaugas & Radziukynas, Virginijus & ValakeviÄ ius, Eimutis, 2018. "Numerical solution of reliability models described by stochastic automata networks," Reliability Engineering and System Safety, Elsevier, vol. 169(C), pages 570-578.
    9. Tuǧrul Dayar & Akın Meriç, 2008. "Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes," Annals of Operations Research, Springer, vol. 164(1), pages 193-210, November.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:148:y:2003:i:2:p:436-451. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.