DocumentCode
2888195
Title
Net hierarchies
Author
Schiel, Ulrich
Author_Institution
Dept. de Sistemas e Computacao, Univ. Federal da Paraiba, Campina Grande, Brazil
fYear
1990
fDate
7-9 Mar 1990
Firstpage
554
Abstract
It is noted that the existing approaches to net refinements have the disadvantage that the final schema net remains flat (like a program developed by step-by-step refinement) and the higher level nodes of the net disappear or all nodes of all levels remain on one level in the final schema. The author proposes a refining constraint and procedure which determines a net hierarchy as a real hierarchy of nets and allows the desired refinement of S-elements and T-elements. As a consequence, the conceptual schema can be viewed as a hierarchy of several modules, each module being a valid Petri net
Keywords
Petri nets; distributed databases; object-oriented programming; Petri net; S-elements; T-elements; higher level nodes; net hierarchy; net refinements; refining constraint; Computer aided software engineering; Concurrent computing; Graphics; Information systems; Joining processes; Object oriented databases; Object oriented modeling; Petri nets;
fLanguage
English
Publisher
ieee
Conference_Titel
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
Conference_Location
Miami Beach, FL
Print_ISBN
0-8186-2035-8
Type
conf
DOI
10.1109/PARBSE.1990.77220
Filename
77220
Link To Document