In this paper, I show that methods from computational algebraic geometry can be used to carry out symbolic model checking using an encoding of Boolean sets as the common zeros of sets of polynomials. This approach could serve as a useful supplement to symbolic model checking methods based on Ordered Binary Decision Diagrams and may provide important theoretical insights by bringing the powerful mathematical machinery of algebraic geometry to bear on the model checking problem.
CITATION STYLE
Avrunin, G. S. (1996). Symbolic model checking using algebraic geometry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1102, pp. 26–37). Springer Verlag. https://doi.org/10.1007/3-540-61474-5_55
Mendeley helps you to discover research relevant for your work.