A methodology for constructing predicate transition net specifications

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. The methodology is illustrated through the specification of a lift system. The methodology can significantly reduce the constructing complexity and enhance the comprehensibility of large predicate transition net specifications.

Generating an Algebraic Specification from an ER-Model

“…Information systems, however, require the joint description of functional properties and conceptal properties of data, hence a formalism specifying both the functional and the data view could make use of a tight coupling of Petri nets and ER-diagrams. In this section we propose such a marriage through condition-event nets [18,13]. The following denition is an adaptation of Reisig's denition of this class of nets, see [18,Sec.…”

Formal verification and testing of software architectural models

“…The behavioral models are defined in Petri nets and for the purposes of this dissertation the kind of Petri nets used are Predicate Transition Nets or PrT nets ( [30] and [39]). …”

Transformations on hierarchical predicate transition nets: refinements and abstractions

“…Specification refinement techniques for concurrent systems were also explored in [Lam83], [Bac90], and [AL91], and reported in [BRR90]. Many Petri net specific refinement techniques have also been developed, including techniques for low-level Petri nets ( [Val79], [SM83], [Vog87], [Ber87]), high-level Petri nets ( [Gen90], [Had90]), and hierarchical high-level Petri nets ( [HL91], [Jen92]). …”

“…Specification transformation techniques for HPrTNs include abstraction, refinement, synthesis (compostion), and decomposition. However the refinement and abstraction techniques discussed in this paper generalize those given in [HL91] and are applicable to not only net structure but also net inscription.…”

“…All of the above specification construction approaches are supported in HPrTNs and are called transformation techniques in [HL91]. Specification transformation techniques for HPrTNs include abstraction, refinement, synthesis (compostion), and decomposition.…”