In: Software--Practice and Experience, Vol. 21, No. 8, pages 845-875. August 1991.
Abstract: In this paper, a methodology for constructing hierarchical and structured predicate transition net specifications is developed, which includes new systematic notation extensions for supporting various transformation techniques upon predicate transition nets and several rules for applying such transformation techniques. The levelling technique in data-flow diagrams is adapted in the refinement and the abstraction techniques, and the state decomposition idea in state-charts is employed in designing various label formulation operators.
Keywords: hierarchical (and) structured predicate/transition net specification; levelling technique; refinement; abstraction; state decomposition; transformation technique; structured analysis.
Back to the Petri Nets Bibliography