Bisimulations on Data Graphs

Abriola, Sergio; Barceió, Pablo; Figueira, Diego; Figueira, Santiago

doi:10.1613/jair.5637

Cited by 13 publications

(15 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, in this article we consider arbitrary data graphs as models for XPath = . Data graphs are the underlying mathematical structure in graph databases (see, e.g., [LV12,RWE13,AG08]) and it is important to study the metalogical properties of languages to query this particular kind of models (see, e.g., [LMV16,ABFF18]). In this respect, we focus on a variant of XPath = which provides us with several interesting expressivity features.…”

Section: Xpath As a Modal Logic With Data Testsmentioning

confidence: 99%

“…Bisimulation for XPath on data trees was investigated in [FFA14,FFA15]. In [ABFF16,ABFF18] it is shown that the same notion can be used in arbitrary models. It is simple to extend these definitions to take into account hybrid operators (see, e.g., [ABM01,BdRV01]).…”

Section: A Note On Bisimulationsmentioning

confidence: 99%

“…It is straightforward to prove that HXPath = -bisimilar models satisfy the same HXPath =formulas (see [ABFF18]). We can extend the notion of -bisimulation introduced in [FFA15] in a similar way.…”

Section: A Note On Bisimulationsmentioning

confidence: 99%

See 2 more Smart Citations

Axiomatizing Hybrid XPath with Data

Areces¹,

Fervari²

2021

Logical Methods in Computer Science

View full text Add to dashboard Cite

In this paper we introduce sound and strongly complete axiomatizations for XPath with data constraints extended with hybrid operators. First, we present HXPath=, a multi-modal version of XPath with data, extended with nominals and the hybrid operator @. Then, we introduce an axiomatic system for HXPath=, and we prove it is strongly complete with respect to the class of abstract data models, i.e., data models in which data values are abstracted as equivalence relations. We prove a general completeness result similar to the one presented in, e.g., [BtC06], that ensures that certain extensions of the axiomatic system we introduce are also complete. The axiomatic systems that can be obtained in this way cover a large family of hybrid XPath languages over different classes of frames, for which we present concrete examples. In addition, we investigate axiomatizations over the class of tree models, structures widely used in practice. We show that a strongly complete, finitary, first-order axiomatization of hybrid XPath over trees does not exist, and we propose two alternatives to deal with this issue. We finally introduce filtrations to investigate the status of decidability of the satisfiability problem for these languages.

show abstract

Section: Xpath As a Modal Logic With Data Testsmentioning

confidence: 99%

Section: A Note On Bisimulationsmentioning

confidence: 99%

See 1 more Smart Citation

Axiomatizing Hybrid XPath with Data

Areces¹,

Fervari²

2021

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

“…For an overview on the expressiveness and evaluation of XPath, we refer the reader to [Benedikt and Koch 2008;Bojańczyk and Parys 2011]. The problem of testing for bisimulation in this setting has also been addressed in [Abriola et al 2016;Figueira et al 2015]. Axiomatizations and calculi for XPath have been proposed in [Baelde et al 2016;Abriola et al 2017a;Areces et al 2017;Areces and Fervari 2016].…”

Section: Other Formalisms For Trees With Data Valuesmentioning

confidence: 99%

Stochastic process algebras and their markovian semantics

Hillston

2018

ACM SIGLOG News

View full text Add to dashboard Cite

There is a long tradition of quantitative modelling in computer and telecommunication systems for performance evaluation and dependability analysis, dating back to the early work of Erlang on telephone exchanges at the beginning of twentieth century [Erlang 1917]. These models are typically stochastic, not because the behaviour of the system under study is inherently random, but because the models usually abstract from data and because interactions with humans are often intrinsic to the system, and both of these give rise to apparently stochastic behaviour. Whilst systems remained of moderate size, models could readily be hand-crafted, and results such as Little's Law were derived and widely-used, for example to optimise job shops [Little 1961]. Much work, like Little's Law, was based on a queueing abstraction, treating the resource in the system as the server of a queue, with users following an appropriate queueing discipline before gaining access to the resource. The more contention there is for the resource, the longer jobs are likely to spend in the queue waiting for access. The queueing paradigm is based on an essentially sequential view of computation and communication, with jobs flowing between resources, completing one task after another. Nevertheless it functioned extremely well until the 1980s, and for many people performance modelling was synonymous with queueing theory. However, the arrival of distributed systems that allowed jobs to access more than one resource at once, and multicast and broadcast communication, broke the assumptions of basic queueing theory making it much harder to carry out quantitative analysis of stochastic systems in order to predict non-functional properties such as performance, availability, reliability and dependability.

show abstract

“…The most impressive application works deal with movie actor indexing, but it is worth noting that the prior knowledge of appearance models for a cast [13] and the number of searching clusters (i.e. the number of characters) makes the task easier [1]. Besides, support by existing video captions [27] or other contextual knowledge is required [3].…”

Section: Introductionmentioning

confidence: 99%

Video Indexing Using Face Appearance and Shot Transition Detection

Cazzato

Leo

Carcagnì

et al. 2019

2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)

View full text Add to dashboard Cite

The possibility to automatically index human faces in videos could lead to a wide range of applications such as automatic video content analysis, data mining, on-demand streaming, etc. Most relevant works in the literature gather full indexing of videos in real scenarios by exploiting additional media features (e.g. audio and text) that are fused with facial appearance information to make the whole frameworks accurate and robust. Anyway, there exist some application contexts where multimedia data are either not available or reliable and for which available solutions are not well suited. This paper tries to explore this challenging research path by introducing a new fully computer vision based video indexing pipeline. The system has been validated and tested in two different typical scenarios where no-multimedia data could be exploited: broadcasted political video documentaries and healthcare therapies sessions about non-verbal skills.

show abstract

Bisimulations on Data Graphs

Cited by 13 publications

References 45 publications

Axiomatizing Hybrid XPath with Data

Axiomatizing Hybrid XPath with Data

Stochastic process algebras and their markovian semantics

Video Indexing Using Face Appearance and Shot Transition Detection

Contact Info

Product

Resources

About