Abordagens paralelas para Model Checking de redes de aut?matos estoc?sticos

• Ano de defesa: 2013
• Autor(a) principal: Oleksinski, Lucas Giaretta
• Orientador(a): Dotti, Fernando Lu?s
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Pontif?cia Universidade Cat?lica do Rio Grande do Sul
• Programa de Pós-Graduação: Programa de P?s-Gradua??o em Ci?ncia da Computa??o
• Departamento: Faculdade de Inform?ca
• País: BR
• Palavras-chave em Português: INFORM?TICA; REDES DE AUT?MATOS ESTOC?STICOS; L?GICA TEMPORAL (COMPUTA??O); SIMULA??O E MODELAGEM EM COMPUTADORES
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: http://tede2.pucrs.br/tede2/handle/tede/5235

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.