Enumeration of reachable and other states of simple version of Systems of Simple Sequential Processes with Resources (S3PR)
Daniel Yuh Chao, Hung-Yi Chen, Fang Yu · 2012
This paper reports the very first endeavor toward the computation of the number of reachable states for simple version of Systems of Simple Sequential Processes with Resources (S3PR) without the construction of reachability graph that often makes the analysis intractable. This paper also estimates the number of non-reachable, forbidden, and deadlock states.