A Hierarchical Description of Partial Languages and Its Application to Condition/Event Nets Construction Problem

Abstract

A partial language allows us to describe the behavior of Petri nets correctly. In a partial language, refinement means replacing an event by some partial language. In this paper, we first define a hierarchical partial language which ensures the same refined partial language without the distinction of order of replacement. We then study a condition/event net construction problem with specification described by a hierarchical partial language and present a solition technique.