Skip to main content
SpringerLink
Log in
Book cover

International Conference on Analytical and Stochastic Modeling Techniques and Applications

ASMTA 2009: Analytical and Stochastic Modeling Techniques and Applications pp 279–293Cite as

Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5513))

Abstract

We present some Continuous Time Stochastic Automata Networks (SAN) based on Master/Slave synchronizations with a product form steady-state distribution. The proof is purely algebraic and is based on some simple properties of the tensor product. The result generalizes many known theorems on product form of queueing networks.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boucherie, R.: A Characterization of independence for competing Markov chains with applications to stochastic Petri nets. IEEE Trans. Software Eng. 20(7), 536–544 (1994)

    Article  Google Scholar 

  2. Buchholz, P., Dayar, T.: Comparison of Multilevel Methods for Kronecker-based Markovian Representations. Computing Journal 73(4), 349–371 (2004)

    MathSciNet  MATH  Google Scholar 

  3. Dayar, T., Gusak, O., Fourneau, J.M.: Stochastic Automata Networks and Near Complete Decomposability. SIAM Journal on Matrix Analysis and Applications 23, 581–599 (2002)

    MathSciNet  MATH  Google Scholar 

  4. Dao-Thi, T.-H., Mairesse, J.: Zero-Automatic Networks. Discrete Event Dynamic Systems 18(4), 499–536 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Donnatelli, S.: Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space. Performance Evaluation 18, 21–36 (1993)

    Article  MathSciNet  Google Scholar 

  6. Fernandes, P., Plateau, B., Stewart, W.J.: Efficient Descriptor-Vector Multiplications in Stochastic Automata Networks. In: JACM, pp. 381–414 (1998)

    Google Scholar 

  7. Fourneau, J.M., Kloul, L., Quessette, F.: Multiple class G-networks with jumps back to Zero. IEEE Mascots 95, 28–32 (1995)

    Google Scholar 

  8. Fourneau, J.M., Plateau, B., Stewart, W.: Product form for Stochastic Automata Networks. In: Proc. of ValueTools 2007, Nantes, France (2007)

    Google Scholar 

  9. Fourneau, J.M., Plateau, B., Stewart, W.: An Algebraic Condition for Product Form in Stochastic Automata Networks without Synchronizations. Performance Evaluation 65(11-12), 854–868 (2008)

    Article  Google Scholar 

  10. Fourneau, J.M.: Discrete Time Markov chains competing over resources: product form steady-state distribution. In: IEEE QEST 2008, pp. 147-156 (2008)

    Google Scholar 

  11. Fourneau, J.-M.: Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations. In: Thomas, N., Juiz, C. (eds.) EPEW 2008. LNCS, vol. 5261, pp. 110–124. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Gelenbe, E.: Product form queueing networks with negative and positive customers. Journal of Applied Probability 28, 656–663 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gelenbe, E.: G-Networks with signals and batch removal. Probability in the Engineering and Informational Sciences 7, 335–342 (1993)

    Article  Google Scholar 

  14. Gelenbe, E., Fourneau, J.M.: G-networks with resets. Performance Evaluation 49(1/4), 179–191 (2002)

    Article  MATH  Google Scholar 

  15. Harrison, P.G., Hillston, J.: Exploiting Quasi-reversible Structures in Markovian Process Algebra Models. Computer Journal 38(7), 510–520 (1995)

    Article  Google Scholar 

  16. Harrison, P.G.: Turning back time in Markovian process algebra. Theoretical Computer Science 290, 1947–1986 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  17. Harrison, P.G.: Reversed processes, product forms and a non-product form. Journal of Linear Algebra and Applications 386, 359–381 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  18. Harrison, P.G.: Compositional reversed markov processes with applications to G-networks. Performance Evaluation 57, 379–408 (2004)

    Article  Google Scholar 

  19. Hillston, J., Thomas, N.: Product Form Solution for a Class of PEPA Models. Performance Evaluation 35(3-4), 171–192 (1999)

    Article  MATH  Google Scholar 

  20. Kloul, L., Hillston, J.: An efficient Kronecker representation for PEPA models. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, p. 120. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Plateau, B.: On the Stochastic Structure of Parallelism and Synchronization Models for Distributed Algorithms. In: Proc. ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, Austin, Texas (August 1985)

    Google Scholar 

  22. Plateau, B., Fourneau, J.M., Lee, K.H.: PEPS: A Package for Solving Complex Markov Models of Parallel Systems. In: Proceedings of the 4th Int. Conf. on Modeling Techniques and Tools for Computer Performance Evaluation, Majorca (1988)

    Google Scholar 

  23. Stewart, W.J., Atif, K., Plateau, B.: The numerical solution of Stochastic Automata Networks. European Journal of Operation Research 86(3), 503–525 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PRiSM, Université de Versailles-Saint-Quentin, CNRS, UniverSud, Versailles, France

    Thu Ha Dao Thi & Jean Michel Fourneau

Authors
  1. Thu Ha Dao Thi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean Michel Fourneau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Advanced Technology, University of Glamorgan, CF37 1DL, Pontypridd, UK

    Khalid Al-Begain

  2. Department TELIN, Ghent University, Sint-Pietersnieuwstraat 41, 9000, Gent, Belgium

    Dieter Fiems

  3. Budapest University of Technology and Economics, P.O. Box 91, 1521, Budapest, Hungary

    Gábor Horváth

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dao Thi, T.H., Fourneau, J.M. (2009). Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor. In: Al-Begain, K., Fiems, D., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2009. Lecture Notes in Computer Science, vol 5513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02205-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02205-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02204-3

  • Online ISBN: 978-3-642-02205-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation