A Compositional Sweep-Line State Space Exploration Method [chapter]

Lars Michael Kristensen, Thomas Mailund
2002 Lecture Notes in Computer Science  
State space exploration is a main approach to verification of finite-state systems. The sweep-line method exploits a certain kind of progress present in many systems to reduce peak memory usage during state space exploration. We present a new sweep-line algorithm for a compositional setting where systems are composed of subsystems. The compositional setting makes it possible to divide subsystem progress measures into monotone and non-monotone progress measures to further reduce peak memory
more » ... . We show that in a compositional setting, it is possible to automatically obtain a progress measure for the system by combining the progress measure for each subsystem to a progress measure for the full system.
doi:10.1007/3-540-36135-9_21 fatcat:xg3crkf4ija4lnun2ffp3dr5ni