Detecting Temporal Logic Predicates on Distributed Computations

Ogale, Vinit; Garg, Vijay K.

doi:10.1007/978-3-540-75142-7_32

Cited by 23 publications

(14 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some examples of the predicates for which the predicate detection can be solved efficiently are: conjunctive [7,20], disjunctive [7], observer-independent [21,7], linear [7], non-temporal regular [22,9] predicates and temporal [8,23,24].…”

Section: Related Workmentioning

confidence: 99%

“…We show in this paper that it is sufficient to unroll the d-diagram N times where N is the number of processes in the system. We note here that there has been earlier work in detection of temporal logic formulas on distributed computation, such as [7][8][9][10]. However, the earlier work was restricted to verifying the temporal logic formula on the finite computation with the interpretation of liveness predicates modified to work for finite posets.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Modeling and Analyzing Periodic Distributed Computations

Agarwal

Garg

Ogale

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on an infinite computation. In this work, we develop the theory and associated algorithms for predicate detection in infinite runs. In practice, an infinite run can be determined in finite time only if it consists of a recurrent behavior with some finite prefix. Therefore, our study is restricted to such runs. We introduce the concept of d-diagram, which is a finite representation of infinite directed graphs. Given a d-diagram that represents an infinite distributed computation, we solve the problem of determining if a global predicate ever became true in the computation. The crucial aspect of this problem is the stopping rule that tells us when to conclude that the predicate can never become true in future. We also provide an algorithm to provide vector timestamps to events in the computation for determining the dependency relationship between any two events in the infinite run.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Modeling and Analyzing Periodic Distributed Computations

Agarwal

Garg

Ogale

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The restrictive use of negation in [87] is relaxed in [83]. Even though the work in [83,87] is applicable to a richer fragment of temporal logic, these algorithms work with a central monitor.…”

Section: Ltl Predicate Detection Intrusiveness Typesmentioning

confidence: 99%

“…These slices are based on fragments of the logic used to express the global state predicates. These fragments include regular, co-regular, linear, relational and stable predicates (see Mittal and Garg [78], Mittal et al [79], Sen and Garg [88], Ogale and Garg [83]). Some of these solutions construct the slices offline, assuming that the whole histories are available to the slicing algorithms, while others work online, building the slice incrementally.…”

Section: Ltl Predicate Detection Intrusiveness Typesmentioning

confidence: 99%

“…For example, Sen and Garg [87], Ogale and Garg [83] present methods for sliced based predicate detection for a fragment of temporal logic that includes invariants (AG) and possible reachable (EF) operators, which extends the applicability beyond safety properties into a subclass of CTL formulas called Regular CTL (see Sen and Garg [86]). The restrictive use of negation in [87] is relaxed in [83]. Even though the work in [83,87] is applicable to a richer fragment of temporal logic, these algorithms work with a central monitor.…”

Section: Ltl Predicate Detection Intrusiveness Typesmentioning

confidence: 99%

See 1 more Smart Citation

Runtime Verification for Decentralised and Distributed Systems

Francalanza

Pérez

Sánchez

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This chapter surveys runtime verification research related to distributed systems. We report solutions that study how to monitor system with some distributed characteristic, solutions that use a distributed platform for performing a monitoring task, and foundational works that present semantics for decomposing monitors or expressing specifications amenable for distributed systems.We will identify some characteristics that distinguish distributed monitoring from centralised monitoring, and characteristics that allow to classify distributed runtime verification works based on features of the executing platforms, the specification language and the system description. Then, we will use these characteristics to describe and compare the distributed runtime verification solutions proposed in the research literature.

show abstract