Structural Analysis of Boolean Equation Systems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2010
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915432600961024 |
|---|---|
| author | Keiren, Jeroen Reniers, Michel A. Willemse, Tim A. C. |
| author_facet | Keiren, Jeroen Reniers, Michel A. Willemse, Tim A. C. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1002_3222 |
| institution | arXiv |
| publishDate | 2010 |
| record_format | arxiv |
| spellingShingle | Structural Analysis of Boolean Equation Systems Keiren, Jeroen Reniers, Michel A. Willemse, Tim A. C. Logic in Computer Science 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. |
| title | Structural Analysis of Boolean Equation Systems |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/1002.3222 |