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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
PRISM (Probabilistic Model Checker), http://www.prismmodelchecker.org/
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)
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)
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)
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)
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)
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)
Lampka, K., Siegle, M.: Activity-local symbolic state graph generation for high-level stochastic models. In: 13th MMB, pp. 245–264. VDE Verlag (2006)
Lampka, K., Siegle, M.: Analysis of Markov reward models using zero-suppressed multi-terminal BDDs. In: VALUETOOLS, p. 35 (2006)
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)
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)
PEPS Project, http://www-id.imag.fr/Logiciels/peps/userguide.html
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)
Sales, A., Plateau, B.: Reachable state space generation for structured models which use functional transitions. In: QEST 2009, Budapest, Hungary, pp. 269–278 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)