Analysis of Boolean Equation Systems through Structure Graphs

Details Analysis of Boolean Equation Systems through Structure Graphs Analysis of Boolean Equation Systems through Structure Graphs

2010-02-15

arxiv.org/abs/1002.2873v1

EPTCS 18, 2010, pp. 92-107

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.18.7

We analyse the problem of solving Boolean equation systems through the use of structure graphs. The latter are obtained through an elegant set of Plotkin-style deduction rules. Our main contribution is that we show that equation systems with bisimilar structure graphs have the same solution. We show that our work conservatively extends earlier work, conducted by Keiren and Willemse, in which dependency graphs were used to analyse a subclass of Boolean equation systems, viz., equation systems in standard recursive form. We illustrate our approach by a small example, demonstrating the effect of simplifying an equation system through minimisation of its structure graph.

Affiliated with

Also associated with

No associations

Rating

Analysis of Boolean Equation Systems through Structure 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 Analysis of Boolean Equation Systems through Structure Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of Boolean Equation Systems through Structure Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-146095