관계 대수를 이용한 페트리 네트의 모델링

Abstract

This paper proposes an analysis method of Perti nets(PNs) using the relational algebra(RA). More specifically, we represent PNs in relations of the relational model. Based on such representation, we first develop an algorithm for generating reachability trees of PNs. We then develop algorithms for analyzing properties of PNs, such as boundedness, conservation, coverability, reachability, and liveness.

The advantage of this approach is as follows: First, the algorithms represented by RA can be easily converted to a query language such as SQL of the widely used, commerical relational database management systems(DBMSs). Second, we can alleviate the problem of state space explosion because relational DBMSs can handle large amounts of data efficiently. Finally, we can use the DBMSs query language to interpret the Petri nets and make simulation.