Evaluation of Temporal Formulas Based on "Checking By Spheres"

February 12, 2017 ยท Declared Dead ยท ๐Ÿ› Proceedings Euromicro Symposium on Digital Systems Design

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Wiktor B. Daszczuk arXiv ID 1702.03564 Category cs.SE: Software Engineering Citations 10 Venue Proceedings Euromicro Symposium on Digital Systems Design Last Checked 3 months ago
Abstract
Classical algorithms of evaluation of temporal CTL formulas are constructed "bottom-up". A formula must be evaluated completely to give the result. In the paper, a new concept of "top-down" evaluation of temporal QsCTL (CTL with state quantifiers) formulas, called "Checking By Spheres" is presented. The new algorithm has two general advantages: the evaluation may be stopped on certain conditions in early steps of the algorithm (not the whole formula and not whole state space should be analyzed), and state quantification may be used in formulas (even if a range of a quantifier is not statically obtainable).
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Software Engineering

Died the same way โ€” ๐Ÿ‘ป Ghosted