Premium
A methodology for constructing predicate transition net specifications
Author(s) -
He Xudong,
Lee John A. N.
Publication year - 1991
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380210806
Subject(s) - computer science , predicate (mathematical logic) , notation , programming language , predicate abstraction , lift (data mining) , predicate variable , transition system , theoretical computer science , algorithm , model checking , data mining , mathematics , description logic , zeroth order logic , arithmetic , multimodal logic
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.