1993 | ReviewPaper | Chapter
Reachability analysis on distributed executions
Authors : Claire Diehl, Claude Jard, Jean-Xavier Rampon
Published in: TAPSOFT'93: Theory and Practice of Software Development
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.