The State Explosion Problem is always posed; We want to know what are the limits of the techniques developped to solve this problem. In an informal way and from 'machine' point of view we can say that the big problem is reflected in the verification time and the memory space.
We want here to go further, that is to say we want examples for which the same method gives good results in cases and bad results in others, in particular for the following methods: the Partial Order Reduction and Symbolic Observational Graphs.
- Badges
- Science topic
- Similar topics
- Mathematical Sciences
- Graphs
More Oussama Hayane's questions See All
Similar questions and discussions