For the most recent entries see the Petri Nets Newsletter.

On Computing Symmetries and Stubborn Sets.

Varpaaniemi, Kimmo

Helsinki University of Technology, Digital Systems Laboratory, Technical Report B12, 16 pages, April 1994.

Abstract: In this report, we consider two promising methods for alleviating 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.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography