Android-Based Claim System for Electricity Network Customers of PLN Padang Branch

The Padang branch of the State Electricity Company (PLN) is a BUMN responsible for the electricity aspect. Complaints about various electricity problems are difficult for customers, so it is necessary to have a system that can be used as a place for protests and increase PLN's loyalty to customers. The Android-based Claim System is a new application developed to be used by customers as a forum for complaints about electrical problems to the Padang branch of PLN. The Claim System is made into two parts: a Website-based System for PLN and an Android-based Claim Application for customers. Application development using the OOP concept uses UML (Unified Modeling Language) diagrams with the PHP MySql and Android programming languages. The test results were carried out using black box testing with the relevant results. The data of 35 respondents from the assessment questionnaire on the claims system obtained results with an Excellent rating of 78%, a Good rating of 21%, and a Bad rating of 2%. From the analysis results, the Claim System supported by this Android-based Client application can help customers complain about electrical problems quickly and easily.The Padang branch of the State Electricity Company (PLN) is a BUMN responsible for the electricity aspect. Complaints about various electricity problems are difficult for customers, so it is necessary to have a system that can be used as a place for protests and increase PLN's loyalty to customers. The Android-based Claim System is a new application developed to be used by customers as a forum for complaints about electrical problems to the Padang branch of PLN. The Claim System is made into two parts: a Website-based System for PLN and an Android-based Claim Application for customers. Application development using the OOP concept uses UML (Unified Modeling Language) diagrams with the PHP MySql and Android programming languages. The test results were carried out using black box testing with the relevant results. The data of 35 respondents from the assessment questionnaire on the claims system obtained results with an Excellent rating of 78%, a Good rating of 21%, and a Bad rating of 2%. From the analysis results, the Claim System supported by this Android-based Client application can help customers complain about electrical problems quickly and easily

Enhancing active model learning with equivalence checking using simulation relations

We present a new active model-learning approach to generating abstractions of a system from its execution traces. Given a system and a set of observables to collect execution traces, the abstraction produced by the algorithm is guaranteed to admit all system traces over the set of observables. To achieve this, the approach uses a pluggable model-learning component that can generate a model from a given set of traces. Conditions that encode a certain completeness hypothesis, formulated based on simulation relations, are then extracted from the abstraction under construction and used to evaluate its degree of completeness. The extracted conditions are sufficient to prove model completeness but not necessary. If all conditions are true, the algorithm terminates, returning a system overapproximation. A condition falsification may not necessarily correspond to missing system behaviour in the abstraction. This is resolved by applying model checking to determine whether it corresponds to any concrete system trace. If so, the new concrete trace is used to iteratively learn new abstractions, until all extracted completeness conditions are true. To evaluate the approach, we reverse-engineer a set of publicly available Simulink Stateflow models from their C implementations. Our algorithm generates an equivalent model for 98% of the Stateflow models

Formal Verification throughout the Development of Robust Systems

As transistors are becomming smaller and smaller, they become more susceptible to transient faults due to radiation. A system can be modified to handle these faults and prevent errors that are visible from outside. We present a formal method for equivalence checking to verify that this modification does not change the nominal behavior of the system. On the other hand, we contribute an algorithm to formally verify that a circuit is robust against transient faults under all possible input assignments and variability. If equivalence or robustness cannot be shown, a counterexample is generated

Equivalence checking using trace partitioning

One application of equivalence checking is to establish correspondence between a high-level, abstract design and a low-level implementation. We propose a new partitioning technique for the case in which the two designs are substantially different and traditional equivalence-point insertion fails. The partitioning is performed in tandem in both models, exploiting the structure present in the high-level model. The approach generates many but tractable SAT/SMT queries. We present experimental data quantifying the benefit of our partitioning method for both combinational and sequential equivalence checking of difficult arithmetic circuits and control-intensive circuits

Equivalence checking using trace partitioning

One application of equivalence checking is to establish correspondence between a high-level, abstract design and a low-level implementation. We propose a new partitioning technique for the case in which the two designs are substantially different and traditional equivalence-point insertion fails. The partitioning is performed in tandem in both models, exploiting the structure present in the high-level model. The approach generates many but tractable SAT/SMT queries. We present experimental data quantifying the benefit of our partitioning method for both combinational and sequential equivalence checking of difficult arithmetic circuits and control-intensive circuits