[HTML][HTML] Model-checking graded computation-tree logic with finite path semantics
Abstract This paper introduces Graded Computation Tree Logic with finite path semantics
(GCTL f⁎, for short), a variant of Computation Tree Logic CTL⁎, in which path quantifiers are …
(GCTL f⁎, for short), a variant of Computation Tree Logic CTL⁎, in which path quantifiers are …
A robust theory of series parallel graphs
Motivated by distributed data processing applications, we introduce a class of labeled
directed acyclic graphs constructed using sequential and parallel composition operations …
directed acyclic graphs constructed using sequential and parallel composition operations …
On ctl* with graded path modalities
Graded path modalities count the number of paths satisfying a property, and generalize the
existential (E) and universal (A) path modalities of CTL^*. The resulting logic is denoted G …
existential (E) and universal (A) path modalities of CTL^*. The resulting logic is denoted G …
[HTML][HTML] CTL* with graded path modalities
Graded path modalities count the number of paths satisfying a property, and generalize the
existential (E) and universal (A) path modalities of Image 1. The resulting logic is denoted G …
existential (E) and universal (A) path modalities of Image 1. The resulting logic is denoted G …
[PDF][PDF] Consistency checking of attention aware systems.
Attention aware systems keep track of users attention in order to react and provide a better
interaction experience. In the educational setting, recent research results have showed …
interaction experience. In the educational setting, recent research results have showed …
On regular paths with counting and data tests
E Bárcenas, E Benítez-Guerrero, J Lavalle - Electronic Notes in Theoretical …, 2016 - Elsevier
Regular path expressions represent the navigation core of the XPath query language for
semi-structured data (XML), and it has been characterized as the First Order Logic with Two …
semi-structured data (XML), and it has been characterized as the First Order Logic with Two …
[PDF][PDF] Graded CTL* over finite paths
In this paper we introduce the logic Graded Computation Tree Logic over finite paths
(GCTL∗ f, for short), a variant of the Computation Tree Logic CTL∗ in which path quantifiers …
(GCTL∗ f, for short), a variant of the Computation Tree Logic CTL∗ in which path quantifiers …
[PDF][PDF] Query reasoning on data trees with counting.
E Bárcenas, E Benítez-Guerrero, J Lavalle - LANMR, 2016 - ceur-ws.org
Regular path expressions represent the navigation core of the XPath query language for
semi-structured data (XML), and it has been characterized as the First Order Logic with Two …
semi-structured data (XML), and it has been characterized as the First Order Logic with Two …