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. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
