Abstract
The state explosion problem poses great challenges for formal verification of large-scale discrete systems due to exponential space and time requirements. The paper introduces a formal verification technique for large-scale discrete systems called implicit model checking. Within this framework discrete systems are compactly represented by a set of Boolean equations, and the verification problem posed as a Boolean satisfiability problem is solved efficiently by enumerating discrete state space implicitly. Implicit model checking is suitable for large-scale problems since it does not require exponential space. The methodology is applied to large-scale logic-based control systems in chemical processes.
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.
