
...there are applications which require the support of temporal data with branched time evolution, called branchedandtemporal data. in a branchedandtemporal database, both historic versions and...tradeoff. it is an index structure based on the bttree (5). the bttree always splits at a current version whenever a data page or an index...

...as an intrinsic part of the computations rather than as a part of the formulas specifying the computations. our first result is that the branching time logic of fair programs is the same as the branching time logic of probabilistic programs and as the logic of fusion and suffixclosed programs defined by abrahamson. next we give...

...supporting multiversion xml documents, particularly branched versioning. in this paper, we address the problem of evaluating path expression queries over xml documents with branched versions. we extend path joins to work in a branched version environment and to allow queries on multiple...

...expressive power, model checking complexity and succinctness. yet, unlike the case for linear time logics, no canonical temporal logic of branching time was agreed upon. we...its many sublogics suggested in the literature are inside the second level of our hierarchy. we introduce new ehrenfeuchtfraisse games on trees, and use them as our main...

...therefore, there is increasing interest in storage and indexing structures based on a variety of rtrees. these tree structures use the concept of minimum bounding rectangle...it provides opportunity to delay the update operation for the location of moving objects. in this paper therefore, we propose a spatial and temporal indexing structure which uses delay update strategy...

...have been deeply investigated as a useful framework for generalizing standard existential and universal modalities in such a way that they can express statements about a given number of immediately accessible...paper, we investigate this question in the case of the branchingtime temporal logic ctl (gctl, for short...

...or nonassociations (i.e., linear, tree and network structures of object classes/objects with logical and and or branches). taalgebra provides a set of algebraic operators for...uniform treatment. this paper formally defines the taalgebra operators and their mathematical properties. the applications of these operators in query decomposition and processing are illustrated by examples...

...discover ing properties not known a priori. a query is a temporal logic formula containing a special symbol , known as a...temporal logic formula satisfied by the kripke structure . a solution to a temporal logic query on a kripke structure is the set of all propositional formulas...

...i�1. interpret ti(v) as a weight attached to the edge connecting the nodes v and vi in the tree. define l(v) as the total weight of the unique path from the root to v obtained by multiplication of the edge weights. the associated weighted branching process (wbp) is then given...
Published in 2009.

...systems can be decomposed into a collection of "computationtrees" which arise by resolving the nondeterministic, but not probabilistic, choices.the presence of nondeterminism means...fairness is assumed. we introduce a probabilistic branching timelogic... ...