A logical basis for automated interpretation of S-invariants of predicate/transition nets

Author

Moslemie, Abbas

Author_Institution

Dept. of Comput. Sci., Helsinki Univ. of Technol., Espoo, Finland

fYear

1989

fDate

22-24 Nov 1989

Firstpage

248

Lastpage

254

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

Keywords

Petri nets; formal logic; S-invariants; algorithms; automated interpretation; axioms; equality theory; global premises; local premises; logical basis; logical consequences; modal logic calculus; predicate/transition nets; progress properties; Algorithm design and analysis; Calculus; Computer science; Data mining; Digital systems; Educational institutions; Information analysis; Laboratories; Logic; Pressing;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '89. Fourth IEEE Region 10 International Conference

Conference_Location

Bombay

Type

conf

DOI

10.1109/TENCON.1989.176934

Filename

176934