A CTL Model Checker for Stochastic Automata Networks

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). Afonso Sales receives grant from PUCRS (Edital 01/2012 -Programa de Apoio à Atuação de Professores Horistas em Atividades de Pesquisa na PUCRS).