Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

DBPL
2001
Springer

favoriteEmaildiscussreport

113views Database» more DBPL 2001»

Model-Checking Based Data Retrieval

13 years 9 months ago

Model-Checking Based Data Retrieval

Download users.dimi.uniud.it

In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formula of the temporal logic CTL. In this way, the retrieval of data fulﬁlling a query is reduced to the problem of ﬁnding out the states of the model which satisfy the formula (the model-checking problem) that can be done in linear time. Keywords. Semistructured DBs, Temporal Logic, Model-Checking.

Agostino Dovier, Elisa Quintarelli

Real-time Traffic

Database | DBPL 2001 | Kripke Transition System | Temporal Logic | Temporal Logic Ctl |

claim paper

Related Content

» Timed Moore Automata Test Data Generation and Model Checking

» The Role of Model Checking in Critiquing Based on Clinical Guidelines

» Model check stochastic supply chains

» Model checking XML manipulating software

» The Quest for Correct Systems Model Checking of Diagrams and Datatypes

» Model Checking for a FirstOrder Temporal Logic Using Multiway Decision Graphs

» Goanna Syntactic Software Model Checking

» Optimizing Bounded Model Checking for Linear Hybrid Systems

» Approximate Probabilistic Model Checking

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	DBPL
Authors	Agostino Dovier, Elisa Quintarelli

Comments (0)