LTL-Specification for Development and Verification of Control Programs
Salvato in:
| Pubblicato in: | Automatic Control and Computer Sciences vol. 58, no. 7 (Dec 2024), p. 920 |
|---|---|
| Autore principale: | |
| Altri autori: | |
| Pubblicazione: |
Springer Nature B.V.
|
| Soggetti: | |
| Accesso online: | Citation/Abstract Full Text Full Text - PDF |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3254841679 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 0146-4116 | ||
| 022 | |a 1558-108X | ||
| 022 | |a 0005-1047 | ||
| 024 | 7 | |a 10.3103/S0146411624700366 |2 doi | |
| 035 | |a 3254841679 | ||
| 045 | 2 | |b d20241201 |b d20241231 | |
| 100 | 1 | |a Neyzov, M. V. |u Institute of Automation and Electrometry, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia (GRID:grid.435127.6) (ISNI:0000 0004 0638 0315) | |
| 245 | 1 | |a LTL-Specification for Development and Verification of Control Programs | |
| 260 | |b Springer Nature B.V. |c Dec 2024 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a This work continues the series of articles on the development and verification of control programs based on the LTL-specification. The approach consists in describing the behavior of programs by special form of linear temporal logic (LTL) formulae. The developed LTL-specification can be directly verified with the help of a model-checking tool. Next, according to the LTL-specification, a program code is unambiguously built in the imperative programming language. The specification is translated into the program using a template. The novelty of the work is the proposal of two new LTL-specifications, which are declarative and imperative, as well as in a stricter formal justification of this approach to program development and verification. A transition is made to nuXmv, a more advanced verification tool for finite and infinite systems. It is proposed to describe the behavior of control programs in a declarative manner. For this purpose, a declarative LTL-specification is intended, which defines a transition system as a formal model of program behavior. This behavior description method is quite expressive—the theorem on the Turing completeness of the declarative LTL-specification is proved. Next, to build a program code in the imperative language, the declarative LTL-specification is converted to an equivalent imperative LTL-specification. An equivalence theorem is proved, which guarantees that both specifications determine the same behavior. The imperative LTL-specification is translated into an imperative program code according to the presented template. The declarative LTL-specification, which undergoes verification, and the control program based on it are guaranteed to determine the same behavior in the form of a corresponding transition system. Thus, in the verification a model coherent with the actual behavior of the control program is used. | |
| 653 | |a Variables | ||
| 653 | |a Temporal logic | ||
| 653 | |a Design | ||
| 653 | |a Software | ||
| 653 | |a Theorems | ||
| 653 | |a Verification | ||
| 653 | |a Compliance | ||
| 653 | |a Imperative programming | ||
| 653 | |a Specifications | ||
| 653 | |a Equivalence | ||
| 653 | |a Programming languages | ||
| 700 | 1 | |a Kuzmin, E. V. |u Demidov Yaroslavl State University, Yaroslavl, Russia (GRID:grid.99921.3a) (ISNI:0000 0001 1010 8494) | |
| 773 | 0 | |t Automatic Control and Computer Sciences |g vol. 58, no. 7 (Dec 2024), p. 920 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3254841679/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text |u https://www.proquest.com/docview/3254841679/fulltext/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3254841679/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |