Validation and Verification of grafcets using finite state machine
نویسنده
چکیده
This paper presents a method to verify (the internal consistency) and to validate (with respect to the purpose of the builders) Sequential Function Charts [8] (grafcets in French). The method is based upon the translation of any grafcet into its equivalent finite automaton. The proofs of consistency of the models are then established on this automaton. The main difficulty of this approach is the control of the combinatorial explosion implied by the parallel and the synchronous nature of Grafcet. A specific grammar has been developed in order to express the expected properties to prove. An example is given to illustrate the presented approach.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملSysML State Machine Diagram to Simple Promela Verification Model Translation Method
In this study, we developed a method for converting SysML state machine diagrams into Promela models that can be verified using the SPIN model checking tool. The Promela code generated in our approach is a sequential verification model that simplifies the verification process when used in the early stages, and also prevents state explosion in the verification process. Thus, using the sequential...
متن کاملReverse Engineering Integrated Circuits Using Finite State Machine Analysis
Due to the lack of a secure supply chain, it is not possible to fully trust the integrity of electronic devices. Current methods of verifying integrated circuits are either destructive or non-specific. Here we expand upon prior work, in which we proposed a novel method of reverse engineering the finite state machines that integrated circuits are built upon in a non-destructive and highly specif...
متن کاملModel Checking and Random Competition - A Study Using the Model Checking Framework MIC
Using verification techniques to prove the correctness of systems is becoming more and more important. Especially in the domain of embedded and distributed systems, verification techniques are increasingly being used for quality assurance today. Model checking is a verification technique that allows the automatic verification of systems with a finite state space. Developers create a formal spec...
متن کاملSoftware Patterns for Traceability of Requirements to Finite State Machine Behavior
This paper describes a software design pattern (e.g., hierarchical graphs of modelview-controllers) and models of visualization for ontology-enabled traceability, where requirements are traced to elements of finite-state machine behavior (e.g., actions, states, transitions and guard conditions). These ontology-enabled traceability mechanisms will play an important role in the team-based develop...
متن کامل