Abstract
AbstractThis paper gives a survey of a composition model checking methodology and its succesfull instantiation to the model checking of networks of finite-state, timed, hybrid and probabilistic systems with respect to suitable quantitative versions of the modal μ-calculus [Koz82].The method is based on the existence of a quotient construction, allowing a property φ of a parallel system A|B to be transformed into a sufficient and necessary quotient-property φ/ A to be satisfied by the component B. Given a model checking problem involving a network P 1|...|P n and a property φ, the method gradually move (by quotienting) components P i from the network into the formula φ. Crucial to the success of the method is the ability to manage the size of the intermediate quotient-properties by a suitable collection of efficient minimization heuristics.KeywordsModel CheckParallel CompositionLabel Transition SystemReachability AnalysisBound Model CheckThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
