Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
