Abstract
Abstract: In dependable system design, formal techniques such as model checking are useful to perform property analysis of system models. Computation tree logic (CTL) model repair is an approach that complements model checking for obtaining new admissible models that can represent the correct behaviour of systems. In this paper a CTL model repair method for bounded and deadlock free Petri nets (PN) is presented. First, CTL semantics is defined for dealing with PN and a set of basic PN structure transformation operations are introduced. Then an algorithm to repair PN models for fulfilling CTL formulae is presented. The method is illustrated through an example regarding a system which must hold a safety property.
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.
