IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4615-2241-6_13.html

Equivalence Relations for Stochastic Automata Networks

In: Computations with Markov Chains

Author

Listed:
  • Peter Buchholz

    (Universität Dortmund, Informatik IV)

Abstract

Stochastic Automata Networks (SANs) are an efficient means to describe and analyze parallel systems under Markovian assumptions. The main advantage of SANs is the possibility to describe and analyze a complex parallel system in a compositional way such that the transition matrix of the Markov chain underlying the complete SAN can be described in a compositional way using only small matrices specifying single automata and combine these matrices by means of tensor operations. This approach allows, up to a certain extent, the handling of the state space explosion resulting from complex Markov models. In this paper equivalence relations for stochastic automata are introduced such that an automaton in a network can be substituted by an equivalent and usually smaller automaton without affecting the results of an analysis. We consider equivalence according to stationary and transient analysis of SANs.

Suggested Citation

  • Peter Buchholz, 1995. "Equivalence Relations for Stochastic Automata Networks," Springer Books, in: William J. Stewart (ed.), Computations with Markov Chains, chapter 13, pages 197-215, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4615-2241-6_13
    DOI: 10.1007/978-1-4615-2241-6_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-1-4615-2241-6_13. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.