On Computing Symmetries and Stubborn Sets

Reference:

Kimmo Varpaaniemi. On computing symmetries and stubborn sets. Technical Report B12, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland, April 1994.

Abstract:

In this report, we consider two promising methods for allevi ating the state space explosion problem in reachability analysis: the symmetry method and the stubborn set method. We concentrate on the computation of symmetries and stubborn sets. The new algorithms presented in this report help us to save time and space in the symmetry method and to avoid inspecting redundant states in the so called CFFD-preserving stubborn set method.

Keywords:

reachability analysis, symmetry method, stubborn set method, CFFD-semantics, place/transition nets

Suggested BibTeX entry:

@techreport{HUT-TCS-B12,
    address = {Espoo, Finland},
    author = {Kimmo Varpaaniemi},
    institution = {Helsinki University of Technology, Digital Systems Labora tory},
    month = {April},
    number = {B12},
    pages = {16},
    title = {On Computing Symmetries and Stubborn Sets},
    type = {Technical Report},
    year = {1994},
}