Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
The design and implementation of a declarative sensor network system
Proceedings of the 5th international conference on Embedded networked sensor systems
A Semantic Web Reasoner for Rules, Equations and Constraints
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Communications of the ACM - Scratch Programming for All
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Toward distributed declarative control of networked cyber-physical systems
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
An Application Framework for Loosely Coupled Networked Cyber-Physical Systems
EUC '10 Proceedings of the 2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing
Semantic streams: a framework for composable semantic interpretation of sensor data
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
A formal methodology for compositional cross-layer optimization
Formal modeling
Maximizing availability of content in disruptive environments by cross-layer optimization
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
A distributed logical framework designed to serve as a declarative semantic foundation for Networked Cyber-Physical Systems provides notions of facts and goals that include interactions with the environment via external goal requests, observations that generate facts, and actions that achieve goals. Reasoning rules are built on a partially ordered knowledge-sharing model for loosely coupled distributed computing. The logic supports reasoning in the context of dynamically changing facts and system goals. It can be used both to program systems and to reason about possible scenarios and emerging properties. The underlying reasoning framework is specified in terms of constraints that must be satisfied, making it very general and flexible. Inference rules for an instantiation to a specific local logic (Horn clause logic) are given as a concrete example. The key novel features are illustrated with snippets from an existing application-a theory for self-organizing robots performing a distributed surveillance task. Traditional properties of logical inference and computation are reformulated in this novel context, and related to features of system design and execution. Proofs are outlined for key properties corresponding to soundness, completeness, and termination. Finally, the framework is compared to other formal systems addressing concurrent/distributed computation.