Advanced Saturation-based Model Checking of Well-formed Coloured Petri Nets

András Vörös, Dániel Darvas, Attila Jámbor, Tamás Bartha
<span title="">2014</span> <i title="Periodica Polytechnica Budapest University of Technology and Economics"> <a target="_blank" rel="noopener" href="" style="color: black;">Periodica Polytechnica Electrical Engineering and Computer Science</a> </i> &nbsp;
The failure of safety-critical embedded systems may have catastrophic consequences, therefore their development process requires a strong verification procedure to obtain a high confidence of correctness in the specification and implementation. Formal modelling and model checking provides a rigorous, mathematically precise verification method. Practical embedded systems are typically complex, distributed and asynchronous, thus they need expressive and compact formal models, and efficient model
more &raquo; ... hecking approaches. The saturation algorithm has an efficient iteration strategy. Combined with symbolic data structures, it can be used for state space generation and model checking of asynchronous systems. Coloured Petri nets are a good choice for modelling distributed and asynchronous systems, however their integration with saturation has not been solved in the past. In this paper we describe a new approach for applying saturation-based state space generation and model checking to coloured Petri nets. We demonstrate the performance of our new algorithm on the verification of a safety function used in the Reactor Protection System of a nuclear power plant. * This work was partially supported by the ARTEMIS JU and the Hungarian National Development Agency (NFÜ) in the frame of the R3-COP project. † Attila Jámbor and Dániel Darvas were partially supported by the MFB Hungarian Development Bank Plc. 1 the exploration. The problem with saturation is that the symbolic representation it builds for the next-state relation during the state exploration phase imposes a high overhead in the analysis of practical systems. We address this problem by introducing a new strategy to handle the complex logic and large local state spaces encoded in the next-state representation of well-formed coloured Petri nets. The structure of this paper is the following. Section 2 gives an overview of the theoretical background. Section 3 introduces the saturation algorithm, and its application to coloured Petri nets in particular. Our contribution is a new saturation algorithm presented in Section 4. We examine an industrial case study for our algorithm: the verification of a safety function. The description of the verification process and our results are given in Section 5.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.3311/ppee.2080</a> <a target="_blank" rel="external noopener" href="">fatcat:qwfrj5zz45gpbo2esqkn5ribjy</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / </button> </a>