METODIKA PŘEVODU SÍŤOVÉHO GRAFU NA PETRIHO SÍŤ

Abstract

In this paper is enunciated method for transformation of flowchart to a Petri net. In this case there was used technique of representation of elementary activity by transition in Petri net. It’s alternative method to representation of elementary activity by place in Petri net (which is mentioned too). For routine operations is proposed simply method for transformation elementary activity of flowchart to a structural component PAT (Place-Arc-Transition) of Petri net. This simply method is applicable to arc oriented or node oriented flowcharts, or only to table of activities. This simply method can be used for modelling of classic flowchart with time delay activities (time delay on transitions of Petri net) or for modelling only graph of dependences, without time delay. The method is illustrated on example.