Abstract

Model checking of linear-time properties based on possibility measures was studied in previous work (Li and Li (2013)). However, the linear-time properties considered in the previous work was qualitative and was based on Boolean logic, the linear-time properties containing possibility information (we call it fuzzy linear-time properties here, which is based on fuzzy logic) of system could not be represented and tackled using the previous methods. We shall study quantitative model checking of fuzzy linear-time properties based on generalized possibility measures in the paper. Both the model of the system, as well as the properties the system needs to adhere to, are described using possibility information to identify the uncertainty in the model/properties. The systems are modeled by generalized possibilistic Kripke structures (GPKS, in short), and the properties are described by fuzzy linear-time properties. Concretely, fuzzy linear-time properties about reachability, always reachability, constrain reachability, repeated reachability and persistence in GPKSs are introduced and studied. Fuzzy regular safety properties and fuzzy ω-regular properties in GPKSs are introduced, the verification of fuzzy regular safety properties and fuzzy ω-regular properties using fuzzy finite automata are thoroughly studied. It has been shown that the verification of fuzzy regular safety properties and fuzzy ω-regular properties in a finite GPKS can be transformed into the verification of (always) reachability properties and repeated reachability (persistence) properties in the product GPKS introduced in this paper. Several examples are given to illustrate the methods presented in the paper.

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 call

Disclaimer: 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.