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. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Oleksinski, L., Correa, C., Dotti, F. L., & Sales, A. (2013). A CTL model checker for stochastic automata networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8054 LNCS, pp. 286–289). https://doi.org/10.1007/978-3-642-40196-1_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
