In: TENCON'89 Fourth IEEE Region 10 International Conference Information Technologies for the 90's; E²C²: Energy, Electronics, Computers, Communications, Nov 22-24, 1989, Bombay, India, pages 248-254. 1989.
Abstract: A logical basis for automated interpretation of S-invariants of predicate/transition nets is presented. It is based on proving compound logical consequences of two sets of premises derived from a given predicate/transition net: a set of global premises consisting of formulae constructed from the S-invariants and axioms of an equality theory associated with the given net, and a set of local premises consisting of formulae representing the initial marking of the net. Two algorithms for constructing formulae from two different types of S-invariants and a proof procedure for proving logical consequences of these two sets of premises within an adequate calculus of modal logic are described. The unprovability of formulae expressing progress properties is discussed, and two representative examples are given