2012
DOI: 10.1134/s0005117912090081
|View full text |Cite
|
Sign up to set email alerts
|

Verification of a technical system model with linear temporal logic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
8
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(9 citation statements)
references
References 5 publications
1
8
0
Order By: Relevance
“…In this section to facilitate the verification of a rich set of properties and to check the properties of the Expert Cloud such as reachability, fairness, and deadlock the logical properties by using temporal logics such as LTL [26,33,34] and CTL [35,36] are presented. LTL is a formal specification language for specifying and verifying properties of the systems which is widely used in formal verification tools such as the model checkers SPIN [37] and NuSMV 4 [32,38].…”
Section: Checking the Propertiesmentioning
confidence: 99%
“…In this section to facilitate the verification of a rich set of properties and to check the properties of the Expert Cloud such as reachability, fairness, and deadlock the logical properties by using temporal logics such as LTL [26,33,34] and CTL [35,36] are presented. LTL is a formal specification language for specifying and verifying properties of the systems which is widely used in formal verification tools such as the model checkers SPIN [37] and NuSMV 4 [32,38].…”
Section: Checking the Propertiesmentioning
confidence: 99%
“…In this section to facilitate the verification of a rich set of properties and to check the properties of THRD such as reachability, fairness, and deadlock the logical properties, temporal logics such as linear temporal logic (LTL) (Nepeivoda, 2012;Rozier, 2011;Salamah, Gates, & Kreinovich, 2012) and computation tree logic (CTL) (Kamide & Kaneiwa, 2009;Kaneiwa & Kamide, 2011) are presented. The use of temporal logic for specifying the behavioral of a system was first introduced by Pnueli (1977).…”
Section: Checking the Propertiesmentioning
confidence: 99%
“…This sequence of actions repeats itself potentially forever. It is less complex than the scheme in [11]: now we have only one stepping switch instead of the two -but the analogue of our simplified scheme is also used in practice [16]. So in fact we need to verify some special kind of one-counter (not necessarily determined) automaton in LTL -the problem that is known to be PSPACE-hard in general and that becomes undecidable after adding one more counter [3].…”
Section: Ltl Formalizationmentioning
confidence: 99%
“…In particular, it is possible to expand field of applications of the classes of logic to parametrized electromechanical technical systems. The linear temporal logic was successfully used to perform an analysis of new reagent-dozing mechanism [11]. Despite the fact that results of the analysis were confirmed by an experiment, some problems were discovered in this approach.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation