scholarly journals Comparing sat-based bounded model checking rtectl and ectl properties

2017 ◽  
Vol 2 (20) ◽  
pp. 131-147
Author(s):  
Agnieszka M. Zbrzezny
Keyword(s):  
Performance Evaluation ◽  
Model Checking ◽  
Real Time ◽  
Bounded Model Checking ◽  
Transition System ◽  
Running Time ◽  
Computation Tree Logic ◽  
Computation Tree

We compare two SAT-based bounded model checking algorithms for the properties expressed in the existential fragment of a soft real-time computation tree logic (RTECTL) and in the existential fragment of computation tree logic (ECTL). To this end, we use the generic pipeline paradigm (GPP) and the train controller system (TC), the classic concurrency problems, which we formalise by means of a finite transition system. We consider several properties of the problems that can be expressed in both RTECTL and ECTL, and we present the performance evaluation of the mentioned bounded model checking methods by means of the running time and the memory used.

Bounded Model Checking for Probabilistic Computation Tree Logic

2012 ◽  
Vol 23 (7) ◽  
pp. 1656-1668 ◽  
Author(s):  
Cong-Hua ZHOU ◽  
Zhi-Feng LIU ◽  
Chang-Da WANG
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
Probabilistic Computation ◽  
Computation Tree Logic ◽  
Computation Tree

scholarly journals Quantitative Verification of Stochastic Regular Expressions

2021 ◽  
Vol 179 (2) ◽  
pp. 135-163
Author(s):  
Sinem Getir Yaman ◽  
Esteban Pavese ◽  
Lars Grunske
Keyword(s):  
Performance Evaluation ◽  
Model Checking ◽  
Regular Expressions ◽  
Verification Algorithm ◽  
Computation Tree ◽  
Quantitative Verification ◽  
Probabilistic Action ◽  
Local Results ◽  
Novel Model ◽  
Stochastic Regular Expressions

In this article, we introduce a probabilistic verification algorithm for stochastic regular expressions over a probabilistic extension of the Action based Computation Tree Logic (ACTL*). The main results include a novel model checking algorithm and a semantics on the probabilistic action logic for stochastic regular expressions (SREs). Specific to our model checking algorithm is that SREs are defined via local probabilistic functions. Such functions are beneficial since they enable to verify properties locally for sub-components. This ability provides a flexibility to reuse the local results for the global verification of the system; hence, the framework can be used for iterative verification. We demonstrate how to model a system with an SRE and how to verify it with the probabilistic action based logic and present a preliminary performance evaluation with respect to the execution time of the reachability algorithm.

USING COMPUTATION TREE LOGIC FOR INTELLIGENT INFORMATION SEARCH ON THE WEB

2002 ◽  
Vol 02 (03) ◽  
pp. 245-253 ◽  
Author(s):  
EUGENIO DI SCIASCIO ◽  
FRANCESCO M. DONINI ◽  
MARINA MONGIELLO
Keyword(s):  
Information Search ◽  
State Transition ◽  
Transition System ◽  
Prototype System ◽  
Retrieval Models ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Finite State ◽  
State Transition System ◽  
Intelligent Information

Web engines crawl hyperlinks to search for new documents; yet when they index discovered documents they basically revert to conventional information retrieval models and concentrate on the indexing of terms in a single document. We propose to overcome such limits with an approach based on temporal logic. By modeling a web site as a finite state transition system we are able to define complex and selective queries over hyperlinks with the aid of Computation Tree Logic operators. We deployed the proposed approach in a prototype system that allows users pose queries in natural language. Queries are automatically translated in Computation Tree Logic, and the answer returned by our system is a set of paths. Experiments carried out with the aid of human experts show improved retrieval effectiveness with respect to current search engines.

scholarly journals Incremental Construction of Counterexamples in Model Checking Web Documents

10.29007/c8jt ◽  
2018 ◽  
Author(s):  
Franz Weitl ◽  
Shin Nakajima
Keyword(s):  
Model Checking ◽  
Description Logic ◽  
Level Of Detail ◽  
Web Documents ◽  
Web Based ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Incremental Construction ◽  
Analysis Of Error

A new algorithm for incrementally generating counterexamples for the temporal description logic ALCCTL is presented. ALCCTL is a decidable combination of the description logic ALC and computation tree logic CTL that is expressive for content- and structure-related properties of web documents being verified by model checking. In the case of a specification violation, existing model checkers provide a single counterexample which may be large and complex. We extend existing algorithms for generating counterexamples in two ways. First, a coarse counterexample is generated initially that can be refined subsequently to the desired level of detail in an incremental manner. Second, the user can choose where and in which way a counterexample is refined. This enables the interactive step-by-step analysis of error scenarios according to the user's interest.We demonstrate in a case study on a web-based training document that the proposed approach reveals more errors and explains the cause of errors more precisely than the counterexamples of existing model checkers. In addition, we demonstrate that the proposed algorithm is sufficiently fast to enable smooth interaction even in the case of large documents.

Sign in / Sign up

Export Citation Format

Share Document