A CTL Model Checker for Stochastic Automata Networks

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.

[1]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[2]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[3]  Markus Siegle,et al.  Activity-local symbolic state graph generation for high-level stochastic models , 2006, MMB.

[4]  Manuel Núñez,et al.  Applying Formal Methods: Testing, Performance, and M/E-Commerce , 2004, Lecture Notes in Computer Science.

[5]  Gianfranco Ciardo,et al.  Advanced features in SMART: the stochastic model checking analyzer for reliability and timing , 2009, PERV.

[6]  Paulo Fernandes,et al.  Modular analytical performance models for ad hoc wireless networks , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[7]  David Parker,et al.  Symbolic Representations and Analysis of Large Probabilistic Systems , 2004, Validation of Stochastic Systems.

[8]  Afonso Sales.  SAN lite-solver: a user-friendly software tool to solve SAN models , 2012, SpringSim.

[9]  Markus Siegle,et al.  Analysis of Markov reward models using zero-suppressed multi-terminal BDDs , 2006, valuetools '06.

[10]  Brigitte Plateau.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.

[11]  Gianfranco Ciardo,et al.  Ten Years of Saturation: A Petri Net Perspective , 2012, Trans. Petri Nets Other Model. Concurr..

[12]  Gianfranco Ciardo,et al.  Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation , 2001, TACAS.

[13]  Afonso Sales,et al.  Reachable State Space Generation for Structured Models which Use Functional Transitions , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[14]  Paulo Fernandes,et al.  The Need for and the Advantages of Generalized Tensor Algebra for Structured Kronecker Representations , 2005 .

[15]  Matthias Kuntz,et al.  Symbolic Performance and Dependability Evaluation with the Tool CASPA , 2004, FORTE Workshops.