The new algorithms presented in this report help us to save time and space in the symmetry method and to avoid inspecting redundant states in the so called CFFD-preserving stubborn set method. Branching time temporal properties can be verified, too. The main goal is clarity of the model and its feasibility for automated analysis. The intruder and the communication channels are modelled as one entity that has complete control over all messages in the system. The intruder model is based on the concepts of memory and learning.
Special care is taken that the model captures all possible actions of the intruder.
Guidelines are given for finding the minimal number of model parts that represents a system with an arbitrary number of entities and concurrent protocol runs. Techniques of coping with state space explosion in reachability analysis, the stubborn set method and prioritizing of transitions, are discussed. Introduction of set type places or negative arcs in the net formalism is proposed as a solution for reducing the storage space requirements of the reachability graph. In experiments with the reachability analysis tool PROD, the model proved efficient in detecting protocol failures. The aim of this work is to define a new class of logic programs, strongly range restricted logic programs, and to design and implement an efficient algorithm for grounding them locally.