A CTL model checker for stochastic automata networks

Authors:
Lucas Oleksinski;Claiton Correa;Fernando Luís Dotti;Afonso Sales
Affiliations:
PUCRS - FACIN, Porto Alegre, Brazil;PUCRS - FACIN, Porto Alegre, Brazil;PUCRS - FACIN, Porto Alegre, Brazil;PUCRS - FACIN, Porto Alegre, Brazil
Venue:
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Year:
2013

Citing 9
Cited 0

On the stochastic structure of parallelism and synchronization models for distributed algorithms
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Modular Analytical Performance Models for Ad Hoc Wireless Networks

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Advanced features in SMART: the stochastic model checking analyzer for reliability and timing

ACM SIGMETRICS Performance Evaluation Review
Reachable State Space Generation for Structured Models which Use Functional Transitions

QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
PRISM 4.0: verification of probabilistic real-time systems

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Ten years of saturation: a petri net perspective

Transactions on Petri Nets and Other Models of Concurrency V
SAN lite-solver: a user-friendly software tool to solve SAN models

Proceedings of the 2012 Symposium on Theory of Modeling and Simulation - DEVS Integrative M&S Symposium

Quantified Score

Hi-index	0.00

Visualization

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.