No label defined (Q3704886)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3932379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3932379 |
Statements
1985
0 references
concurrency
0 references
branching-time temporal logic
0 references
state-transition graph
0 references
finite Kripke structure
0 references
system specification
0 references
model-checker
0 references
fair sequences
0 references
fairness problem
0 references
correctness of sequential circuits
0 references
0.9015045166015624
0 references
0.8905343413352966
0 references
0.8364391922950745
0 references
[For the entire collection see Zbl 0566.00027.] The authors give an automatic proof construction for the investigation of properties of finite state systems. For this: 1) the state-transition graph, viewed as a finite Kripke structure is extracted from the system (using a description language called SML), 2) the system specification (the properties which must be verified) is realized as a branching-time temporal (b-tt) logic formula (using CTL: a specification language), 3) the verification is realized using a standard algorithm (the model- checker) which determines whether the structure satisfies the specification or not. Because the correctness of fair sequences cannot be expressed in b-tt logic, the fairness problem was transferred in the specification semantics which allows only fair paths. The authors exemplify their approach and compare it with other works, showing its flexibility and expressive power; although usable for finite state systems, the authors believe their method as being most useful in analyzing the correctness of sequential circuits.
0 references