The algorithm of a synthesis technique for concurrent systems

Abstract

A synthesis technique that relieves the complexity problems that can be encountered in verification of concurrent systems by avoiding verification is presented. With this technique, Petri nets are used for modeling concurrent systems. A temporal matrix is used to record relationship (concurrent, exclusive, serial, etc.) among processes and to detect rule violations as new generations are generated. A set of synthesis rules was developed for incrementally generating new processes without incurring logical incorrectness. The authors develop an algorithm to detect rule violations and to update the T-matrix. The complexity of the algorithm is polynomial and O(N/sup 3/), where N is the total number of pseudo-processes when the final system design is completed.<>