Using A Kernel P System to Solve The 3-Col Problem

Abstract

The newly introduced Kernel P systems offer an unitary and elegant way of integrating established features of existing P system variants with new elements with potential value for formal modelling. This paper presents a case study illustrating the expressive power and efficiency of kernel P systems on the 3-Col problem. The use of model checking (in particular of Spin) for formal verification of kernel P systems is also discussed and illustrated in this case.