Open AccessHIERARCHICAL DECOMPOSITION OF PETRI NETS FOR ANALYSIS AND DESIGN OF DIGITAL MICROSYSTEMS
Author(s) -
Andrei Karatkevich,
G. Andrzejewski
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.5.1.376
Subject(s) - petri net , liveness , reachability , decomposition , computer science , stochastic petri net , reachability problem , theoretical computer science , process architecture , distributed computing , ecology , biology
The paper is dedicated to hierarchical Petri nets with application to design of control devices. It consists of two parts. The first part introduces a concept of simplifying analysis of flat Petri nets (we discuss analysis of reachability and liveness) by means of hierarchical decomposition. We present a class of subnets which can be replaced by the macroplaces. Further we describe properties of such decomposition and show, that analysis of the mentioned properties of a net can be reduced to the corresponding analysis of the elements of decomposition. A method allowing to obtain the decomposition is presented. The second part presents an approach to specification of a digital control system behavior by means of hierarchical Petri nets. We describe a model, called HPN, which has some of important properties, simplifying description of strongly reactive systems.