Open AccessLTL-Specification of Bounded Counter Machines
Author(s) -
E. V. Kuzmin
Publication year - 2022
Publication title -
modelirovanie i analiz informacionnyh sistem
Language(s) - English
Resource type - Journals
eISSN - 2313-5417
pISSN - 1818-1015
DOI - 10.18255/1818-1015-2022-1-44-59
Subject(s) - linear temporal logic , temporal logic , operator (biology) , bounded function , computation tree logic , mathematics , intuitionistic logic , programming language , computer science , interval temporal logic , model checking , satisfiability , theoretical computer science , discrete mathematics , linear logic , algorithm , mathematical analysis , biochemistry , chemistry , repressor , transcription factor , gene
The article revises the results of the work devoted to the problem of representing the behaviour of a program system as a set of formulas of the linear temporal logic LTL, followed by the use of this representation to verify the satisfiability of the program system properties through the procedure of proving the validity of logical inferences, expressed in terms of the LTL logic. The LTL logic is applied to bounded Minsky counter machines that are considered as program systems of which we need to get the specification of its behaviour. Earlier, when working with the temporal logic LTL as a program logic, a special pseudo-operator was actually introduced to refer to the previous values of variables involved in elementary propositions. Despite the fact that this pseudo-operator is easily implemented in the Cadence SMV verifier when proving the validity of logical LTL-inferences, the classical definition of the LTL logic does not imply its presence. In this article, only binary variables will be used to build an LTL-specification for the behaviour of a bounded counter machine, and tracking of previous values of these variables will be carried out exclusively within the LTL logic itself through the appropriate formulas.