Master Thesis Model Checking of Behavior Protocols

In the last years, formal verification has received a proper attention because computer applications get more and more liability in human society. The most important problem is the big a size of checked system that it doesn’t fit into memory, this problem is usually called state explosion. In the thesis, there is suggested a new, memory efficient automata representation based on behavior protocols. The representation succesfully avoids the state explosion problem, frequently encountered by verification of behavior protocols. Unfortunatelly, it exhibits lower perfomance compared to the regular explicit automata, and therefore several speed optimization techniques are also suggsted to handle this problem. As a proof of the concept, a verification framework is created using the suggested representation. This framework was used for compliance checking, visualization and model checking successfully. However, only compliance checking is done internally, visualization and model checking uses external tools. The framework is open enough to support addition of new operators, optimization techniques and backends that perform the actual work.