Abordagens paralelas para Model Checking de redes de autômatos estocásticos

• Autor(a) principal: Oleksinski, Lucas Giaretta
• Data de Publicação: 2013
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Biblioteca Digital de Teses e Dissertações da PUC_RS
• Texto Completo: http://tede2.pucrs.br/tede2/handle/tede/5235
• topic: INFORMÁTICA; REDES DE AUTÔMATOS ESTOCÁSTICOS; LÓGICA TEMPORAL (COMPUTAÇÃO); SIMULAÇÃO E MODELAGEM EM COMPUTADORES; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO

The use of critical and complex systems at automation of daily tasks increases the people s dependence, generating unease about the safety of such systems. In the last years several techniques have been developed to facilitate activities related to design validation in the early stages of the development cycle. Model Checking is an automatic formal technique that allows verification of finite-state concurrent systems under properties described in temporal logics by employing verification algorithms that exhaustively assess the correctness of the system under consideration. Indeed, this technique is costly with respect to storage and processing, justifying the development of parallel and distributed algorithms for powerful computing clusters. This dissertation reports the study and development of verification algorithms for models described in Stochastic Automata Networks and properties written in Computation Tree Logic temporal logic for environments that address memory spaces in a distributed way.