1993 | ReviewPaper | Buchkapitel
Reachability analysis on distributed executions
verfasst von : Claire Diehl, Claude Jard, Jean-Xavier Rampon
Erschienen in: TAPSOFT'93: Theory and Practice of Software Development
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The paper presents basic algorithms for trace checking of distributed programs. In distributed systems, detecting global properties requires a careful analysis of the causal structure of the execution. Based on the on-the-fly observation of the partial order of message causality, we show how to build the lattice of all the reachable states of the distributed system under test. The regular structure of this graph makes it possible to build it with a quasi-linear complexity, which improves substantially the state-of-theart.