On Distributed Model Checking of MSO on Graphs

Details On Distributed Model Checking of MSO on Graphs On Distributed Model Checking of MSO on Graphs

2009-04-13

arxiv.org/abs/0904.1902v1

Computer Science

Logic in Computer Science

30 pages, 4 figures, llncs.cls,llncsdoc.sty

Scientific paper

We consider distributed model-checking of Monadic Second-Order logic (MSO) on graphs which constitute the topology of communication networks. The graph is thus both the structure being checked and the system on which the distributed computation is performed. We prove that MSO can be distributively model-checked with only a constant number of messages sent over each link for planar networks with bounded diameter, as well as for networks with bounded degree and bounded tree-length. The distributed algorithms rely on nontrivial transformations of linear time sequential algorithms for tree decompositions of bounded tree-width graphs.

Affiliated with

Also associated with

No associations

Rating

On Distributed Model Checking of MSO on Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Distributed Model Checking of MSO on Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Distributed Model Checking of MSO on Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-323936