Detection of strong unstable predicates in distributed programs

Garg, Vijay K.; Waldecker, B.

doi:10.1109/71.553309

Cited by 100 publications

(97 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Due to the loose restriction of logical time, corresponding sequences of events may have multiple possibilities in reality [9,11]. A conservative practice is to employ definitely modality [14], which denotes that the conditions of a relation are satisfied in any of the possibilities.…”

Section: Eventsmentioning

confidence: 99%

See 1 more Smart Citation

A Distributed Relation Detection Approach in the Internet of Things

Zhu

Lü

Cui

et al. 2017

Mobile Information Systems

View full text Add to dashboard Cite

In the Internet of Things, it is important to detect the various relations among objects for mining useful knowledge. Existing works on relation detection are based on centralized processing, which is not suitable for the Internet of Things owing to the unavailability of a server, one-point failure, computation bottleneck, and moving of objects. In this paper, we propose a distributed approach to detect relations among objects. We first build a system model for this problem that supports generic forms of relations and both physical time and logical time. Based on this, we design the Distributed Relation Detection Approach (DRDA), which utilizes a distributed spanning tree to detect relations using in-network processing. DRDA can coordinate the distributed treebuilding process of objects and automatically change the depth of the routing tree to a proper value. Optimization among multiple relation detection tasks is also considered. Extensive simulations were performed and the results show that the proposed approach outperforms existing approaches in terms of the energy consumption.

show abstract

Section: Eventsmentioning

confidence: 99%

“…For example, location = is such a predicate denoting that the location of object is at . More complex predicates can be classified into conjunctive predicates and relational predicates [9][10][11]. Conjunctive predicates are in the form of 1 ∧ 2 ∧⋅ ⋅ ⋅ , where ( = 1, 2, .…”

Section: System Model and The Problemmentioning

confidence: 99%

A Distributed Relation Detection Approach in the Internet of Things

Zhu

Lü

Cui

et al. 2017

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…This approach is not as general as the second approach, but it can be used to develop more efficient algorithms for certain classes of predicates. Garg and Waldecker [5], [6] have proposed algorithms of complexity O(n 2 m) to detect possibly : φ and definitely : φ when φ is a conjunction of local predicates.…”

Section: Related Workmentioning

confidence: 99%

“…Several techniques have been used in the literature to improve the dependability of distributed applications. Detection of distributed predicates (runtime verification) is one of the techniques that have attracted a great deal of attention in this regard [1], [2], [3], [4], [5], [6].…”

Section: Introductionmentioning

confidence: 99%

A Harmony Search Based Algorithm for Detecting Distributed Predicates

Al¹

2012

IJACSA

View full text Add to dashboard Cite

Abstract-Detection of distributed predicates (also referred to as runtime verification) can be used to verify that a particular run of a given distributed program satisfies certain properties (represented as predicates). Consequently, distributed predicates detection techniques can be used to effectively improve the dependability of a given distributed application. Due to concurrency, the detection of distributed predicates can incur significant overhead. Most of the effective techniques developed to solve this problem work efficiently for certain classes of predicates, like conjunctive predicates. In this paper, we have presented a technique based on harmony search to efficiently detect the satisfaction of a predicate under the possibly modality. We have implemented the proposed technique and we have conducted several experiments to demonstrate its effectiveness.

show abstract

“…We call this approach optimistic as it assumes that the services in the strong set are sufficient to represent the constraints of the composite service. The concept of a strong set is analogous to the notion of strong unstable predicates [9] or predicates which will "definitely" hold [10] in literature. Strong unstable predicates are true if and only if the predicate is true for all total orders.…”

Section: Mediator With Non-determinismmentioning

confidence: 99%

Web Services Discovery and Constraints Composition

Biswas

Web Reasoning and Rule Systems

View full text Add to dashboard Cite

Abstract. The most promising feature of the Web services platform is its ability to form new (composite) services by combining the capabilities of already existing (component) services. The existing services may themselves be composite leading to a hierarchical composition. In this work, we focus on the discovery aspect. We generalize the characteristics of a service, which need to be considered for successful execution of the service, as constraints. We present a predicate logic model to specify the corresponding constraints. Further, composite services are also published in a registry and available for discovery (hierarchical composition). Towards this end, we show how the constraints of a composite service can be derived from the constraints of its component services in a consistent manner. Finally, we present an incremental matchmaking algorithm which allows bounded inconsistency.

show abstract

Detection of strong unstable predicates in distributed programs

Cited by 100 publications

References 18 publications

A Distributed Relation Detection Approach in the Internet of Things

A Distributed Relation Detection Approach in the Internet of Things

A Harmony Search Based Algorithm for Detecting Distributed Predicates

Web Services Discovery and Constraints Composition

Contact Info

Product

Resources

About