Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
Reasoning about knowledge
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The Piazza peer data management project
ACM SIGMOD Record
The hyperion project: from data integration to data coordination
ACM SIGMOD Record
Business artifacts: An approach to operational specification
IBM Systems Journal
Tools for composite web services: a short overview
ACM SIGMOD Record
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ORCHESTRA: facilitating collaborative data sharing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
The Active XML project: an overview
The VLDB Journal — The International Journal on Very Large Data Bases
The ORCHESTRA Collaborative Data Sharing System
ACM SIGMOD Record
A rule-based language for web data management
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dedalus: datalog in time and space
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Comparing workflow specification languages: A matter of views
ACM Transactions on Database Systems (TODS)
Viewing the Web as a Distributed Knowledge Base
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Hi-index | 0.00 |
We introduce and study a model of collaborative data-driven workflows. In a local-as-view style, each peer has a partial view of a global instance that remains purely virtual. Local updates have side effects on other peers' data, defined via the global instance. We also assume that the peers provide (an abstraction of) their specifications, so that each peer can actually see and reason on the specification of the entire system. We study the ability of a peer to carry out runtime reasoning about the global run of the system, and in particular about actions of other peers, based on its own local observations. A main contribution is to show that, under a reasonable restriction (namely, key-visibility), one can construct a finite symbolic representation of the infinite set of global runs consistent with given local observations. Using the symbolic representation, we show that we can evaluate in PSPACE a large class of properties over global runs, expressed in an extension of first-order logic with past linear-time temporal operators, PLTL-FO. We also provide a variant of the algorithm allowing to incrementally monitor a statically defined property, and then develop an extension allowing to monitor an infinite class of properties sharing the same temporal structure, defined dynamically as the run unfolds. Finally, we consider an extension of the language, that permits workflow control with PLTL-FO formulas. We prove that this does not increase the power of the workflow specification language, thereby showing that the language is closed under such introspective reasoning.