Toward Securing Cyber-Physical Systems Using Exact Cover Set

Abstract

Cyber physical systems (CPS) are computer systems that integrate computing, coordination and communication systems in order to monitor physical entities in the physical world. As they interact with the critical systems and infrastructure that may impact real life. There are many issues in design and constructions of these types of systems. One of the key issue that receives so many attention is the security of such systems. Although security solutions for Information Systems handle the security issues associated with Traditional IT security, but the impact of a failure in a cyber-physical system demands a different approach to handle security issues related to the cyber world. In this work, we focus on using a key agreement technique known as Physical Signal Key Agreement (PSKA) technique using the Exact Cover method to generate the random key which will be embedded into an access control model known as the Modified Context-Aware Security The feasibility of our framework (MCASF) to handle both normal and critical situation on demand is demonstrated via a Pervasive Health Monitoring Systems (PHMS).

Discrete Artificial Dragonflies Algorithm in Agent Based Modelling for Exact Boolean kSatisfiability Problem

“…The idea of the Satisfying of the Boolean Formula is to decide if the Boolean Formula in the Conjunctive Normal Form (CNF) has a true assignment that satisfies each clause or decides that no label assignment exists [4]. Various optimization problem can be translated into Exact kSAT representation is closely related to several interesting NP-complete problems, such as Exact Hitting Set [5], minimum hitting set [6] and Exact cover [7], monotone ExactSAT is the same as the exact hitting [8], set problem on hypergraphs [9], Exact graph colouring problem [10], exact independent set [11] and it is closely related to the set partitioning problem [12]. Various NP-complete problems such as N-queen problems, Scheduling problem, Transportation problem can be transformed and represented in form ExactkSAT and have many applications in combinatorial optimization that falls into the category of optimization, sorting, decision or counting scheme for solving the satisfiability problem and is sub-optimal and partially heuristic in nature.…”