Marko Rauhamaa

Learn More
Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from the state space explosion problem, however, i.e. the state space of a system can be far too large to be completely generated. This thesis is concentrated on the application and theory of the stubborn set method which is one of the(More)
Six recently proposed methods for eecient reachability analysis of distributed systems are studied and compared: symmetry method (Huber et al), parameterising method (Lindqvist), stubborn set method (Valmari), reduction theory (Berthelot, Haddad), symbolic model checking (Burch et al) and incomplete state-space generation (Holzmann). Petri systems are used(More)
  • 1