Abstract
Game theory has emerged as the powerful semantics for some programming languages and logical systems. At present, it is even used to model checking-based verification process. PCTL (probabilistic computation tree logic) is the extension of CTL (computation tree logic), which can be used for model checking stochastic system models (i.e., stochastic model checking). Using the label-extended PPN (probabilistic Petri net) system as the high-level model for stochastic system, a game theory-based formal semantics for PCTL model checking is presented, which is intuitive and succinct compared with the classical semantics for PCTL model checking. The game process for PCTL model checking is implemented in the visual prototype tool, and the feasibility is demonstrated by an illustrative example.
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.
