Abstract
Formally verifying complex real time systems is a formidable task due to state-space explosions. We propose a formal framework in which not only is system concurrency modeled, but scheduling policies are also taken into consideration for verifying temporal properties. We show how the verification of concurrent real time systems, modeled as client-server systems, using the model checking approach can benefit from taking advantage of scheduling policies. Integration of these two concepts, namely scheduling and model checking, provides a reduction of the state space when compared to pure model checking strategies. Our implementation and experiments corroborate the feasibility of our approach. Wide applicability, significant state-space reduction, and several scheduling semantics are important features of the framework.
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.
