Diagnosis of asynchronous discrete event systems
Authors:
Open Access
- 13 June 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 358-367
Abstract
International audienceWe consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a setting where autonomous and distributed peers share large volumes of interelated data.We illustrate the technique with an important telecommunication problem, the diagnosis of distributed telecom systems. We show that (i) the problem can be modeled using Datalog programs, and (ii) it can benefit from the large battery of optimization techniques developed for Datalog. In particular, we show that a simple generic use of the extension of QSQ achieves an optimization as good as that previously provided by dedicated diagnosis algorithms. Furthermore, we show that it allows solving efficiently a much larger class of system analysis problemsKeywords
This publication has 13 references indexed in Scilit:
- Magic Sets and Their Application to Data IntegrationLecture Notes in Computer Science, 2004
- Dynamic XML documents with distribution and replication2003
- Diagnosis of asynchronous discrete-event systems: a net unfolding approachIEEE Transactions on Automatic Control, 2003
- Looking up data in P2P systemsCommunications of the ACM, 2003
- Model checking using net unfoldingsScience of Computer Programming, 1994
- Evaluating recursive queries in distributed databasesIEEE Transactions on Knowledge and Data Engineering, 1993
- Branching processes of Petri netsActa Informatica, 1991
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Parallel evaluation of recursive rule queries1985
- Magic sets and other strange ways to implement logic programs (extended abstract)1985