Learn More
Large-scale systems are often modeled and verified in a component-based way. BIP (Behavior, Interaction, Priority) is a flexible component-based framework which supports hierarchical design of heterogeneous systems. BIP components interact via connectors in which data can be passed among multiple components. It also support the modeling of time. Due to its(More)
Programable logic controllers (PLCs) are complex cyber-physical systems which are widely used in industry. This paper shows the modeling and validation work of a typical PLC control system using the Behavior-Interaction-Priority(BIP) component framework. The gate control system based on PLC is a real industry application. We design general system(More)
Embedded high performance computing is a challenge to both software and hardware engineers. Visual media process is a computing intensive and complex application. A heterogeneous multicore SoC is described which is optimized for embedded visual media process. Optimization begins from the very beginning of the chip design, by analyzing of application(More)
In many reactive systems, programs run cyclically. In each cycle, they check the current status and handle the business for a single step. The business logic has to be blasted to pieces, which violates the way that people are used to. Cyclic programs are difficult to develop and their reliability is hard to guarantee. To tackle these problems, we propose a(More)
With the increasingly application of discrete control software in automatic control field, the security and reliability of its behavior becomes even more essential. However, the traditional verification methods are of high complexity and poor flexibility, so the lightweight Runtime Verification becomes an alternative. In this paper, aiming at real-time(More)
This paper considers bounded model checking for extended labeled transition systems. Bounded model checking relies on a SAT solver to prove (or disprove) the existence of a counterexample with a bounded length. During the translation of a BMC problem to a SAT problem, much useful information is lost. This paper proposes an algorithm to analyze the(More)
ions to be solved quickly. However, the number of clauses increased during the refinement process can usually be ignored. Most of the examples in our experiments show hundreds or even thousands of increase in the number of CNF clauses during the refinements. However, the CNF clause number of the abstraction may reach millions. Cost of constraint solving.(More)