Skip to main content
SpringerLink
Log in

A CTL Model Checker for Stochastic Automata Networks

  • Conference paper
Quantitative Evaluation of Systems (QEST 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8054))

Included in the following conference series:

  • 1167 Accesses

Abstract

Stochastic Automata Networks (SAN) is a Markovian formalism devoted to the quantitative evaluation of concurrent systems. Unlike other Markovian formalisms and despite its interesting features, SAN does not count with the support of model checking. This paper discusses the architecture, the main features and the initial results towards the construction of a symbolic CTL Model Checker for SAN. A parallel version of this model checker is also briefly discussed.

Paper partially sponsored by CNPq (560036/2010-8) and FAPERGS (PqG 1014867).

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brenner, L., Fernandes, P., Sales, A.: The Need for and the Advantages of Generalized Tensor Algebra for Structured Kronecker Representations. Int. Journal of Simulation: Systems, Science & Technology (IJSIM) 6(3-4), 52–60 (2005)

    Google Scholar 

  2. PRISM (Probabilistic Model Checker), http://www.prismmodelchecker.org/

  3. Ciardo, G., Lüttgen, G., Siminiceanu, R.I.: Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 328–342. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Ciardo, G., Miner, A.S., Wan, M.: Advanced features in SMART: the stochastic model checking analyzer for reliability and timing. SIGMETRICS Performance Evaluation Review 36(4), 58–63 (2009)

    Article  Google Scholar 

  5. Ciardo, G., Zhao, Y., Jin, X.: Ten Years of Saturation: A Petri Net Perspective. Transactions Petri Nets and Other Models of Concurrency 5, 51–95 (2012)

    Article  Google Scholar 

  6. Dotti, F.L., Fernandes, P., Sales, A., Santos, O.M.: Modular Analytical Performance Models for Ad Hoc Wireless Networks. In: WiOpt 2005, pp. 164–173 (2005)

    Google Scholar 

  7. Kuntz, M., Siegle, M., Werner, E.: Symbolic Performance and Dependability Evaluation with the Tool CASPA. In: Núñez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds.) FORTE 2004. LNCS, vol. 3236, pp. 293–307. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: Verification of Probabilistic Real-time Systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585–591. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Lampka, K., Siegle, M.: Activity-local symbolic state graph generation for high-level stochastic models. In: 13th MMB, pp. 245–264. VDE Verlag (2006)

    Google Scholar 

  10. Lampka, K., Siegle, M.: Analysis of Markov reward models using zero-suppressed multi-terminal BDDs. In: VALUETOOLS, p. 35 (2006)

    Google Scholar 

  11. Miner, A., Parker, D.: Symbolic Representations and Analysis of Large Probabilistic Systems. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) AUTONOMY 2003. LNCS, vol. 2925, pp. 296–338. Springer, Heidelberg (2004)

    Google Scholar 

  12. Plateau, B.: On the stochastic structure of parallelism and synchronization models for distributed algorithms. In: ACM SIGMETRICS Conf. on Measurements and Modeling of Computer Systems, Austin, USA, pp. 147–154. ACM Press (1985)

    Google Scholar 

  13. PEPS Project, http://www-id.imag.fr/Logiciels/peps/userguide.html

  14. Sales, A.: SAN lite-solver: a user-friendly software tool to solve SAN models. In: SpringSim (TMS-DEVS), Orlando, FL, USA, vol. 44, pp. 9–16. SCS/ACM (2012)

    Google Scholar 

  15. Sales, A., Plateau, B.: Reachable state space generation for structured models which use functional transitions. In: QEST 2009, Budapest, Hungary, pp. 269–278 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PUCRS - FACIN, Porto Alegre, Brazil

    Lucas Oleksinski, Claiton Correa, Fernando Luís Dotti & Afonso Sales

Authors
  1. Lucas Oleksinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claiton Correa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernando Luís Dotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Afonso Sales
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Labs Research, 180 Park Avenue, Building 103, 07932, Florham Park, NJ, USA

    Kaustubh Joshi

  2. Institut für Technische Informatik, Universität der Bundeswehr München, Werner-Heisenberg Weg 39, 85577, Neubiberg, Germany

    Markus Siegle

  3. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, Drienerlolaan 5, Zilverling Building, 7522 NB, Enschede, The Netherlands

    Mariëlle Stoelinga

  4. Facultad de Matemáticas, Astronomía y Física, Universidad Nacional de Córdoba – CONICET, Medina Allende s/n, X5000HUA, Córdoba, Argentina

    Pedro R. D’Argenio

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oleksinski, L., Correa, C., Dotti, F.L., Sales, A. (2013). A CTL Model Checker for Stochastic Automata Networks. In: Joshi, K., Siegle, M., Stoelinga, M., D’Argenio, P.R. (eds) Quantitative Evaluation of Systems. QEST 2013. Lecture Notes in Computer Science, vol 8054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40196-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40196-1_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40195-4

  • Online ISBN: 978-3-642-40196-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation