Abstract
We present an algorithm for conjunctive and disjunctive Boolean equation systems (BESs), which arise frequently in the verification and analysis of finite state concurrent systems. In contrast to the previously best known O(e^2) time solutions, our algorithm computes the solution of such a fixpoint equation system with size e and alternation depth d in O(e log d) time.
| Original language | English |
|---|---|
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Number of pages | 8 |
| Publication status | Published - 2004 |
Publication series
| Name | Computer science reports |
|---|---|
| Volume | 0413 |
| ISSN (Print) | 0926-4515 |