Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

OPODIS

2003

2003

Detecting whether a ﬁnite execution trace (or a computation) of a distributed program satisﬁes a given predicate, called predicate detection, is a fundamental problem in distributed systems. It ﬁnds applications in many domains such as testing, debugging, and monitoring of distributed programs. However predicate detection suffers from the state explosion problem – the number of possible global states of the program increases exponentially with the number of processes. To solve this problem, we generalize an effective abstraction technique called computation slicing. We present polynomialtime algorithms to compute slices with respect to temporal logic predicates from a “regular” subset of CTL, that contains temporal operators EF, EG, and AG. Furthermore, we show that these slices contain precisely those global states of the original computation that satisfy the predicate. Using temporal predicate slices, we give an efﬁcient (polynomial in the number of processes) predicat...

Related Content

Added |
31 Oct 2010 |

Updated |
31 Oct 2010 |

Type |
Conference |

Year |
2003 |

Where |
OPODIS |

Authors |
Alper Sen, Vijay K. Garg |

Comments (0)