Full system verification of compatible microprocessors with a dual physical core verification platform

Author(s):  
Jyun-Yan Li ◽  
Ing-Jer Huang
SIMULATION ◽  
2020 ◽  
Vol 96 (12) ◽  
pp. 969-992
Author(s):  
Kehinde G Samuel ◽  
Nourou-Dine M Bouare ◽  
Oumar Maïga ◽  
Mamadou K Traoré

System verification is an ever-lasting system engineering challenge. The increasing complexity in system simulation requires some level of expertise in handling the idioms of logic and discrete mathematics to correctly drive a full verification process. It is recognized that visual modeling can help to fill the knowledge gap between system experts and analysis experts. However, such an approach has been used on the one hand to specify the behavior of complex systems, and on the other hand to specify complex requirement properties, but not simultaneously. This paper proposes a framework that is unique in supporting a full system verification process based on the graphical modeling of both the system of interest and the requirements to be checked. Patterns are defined to transform the resulting models to formal specifications that a model checker can manipulate. A real-time crossing system is used to illustrate the proposed framework.


Mathematics ◽  
2021 ◽  
Vol 9 (10) ◽  
pp. 1074
Author(s):  
Vincent Wagner ◽  
Nicole Erika Radde

The Chemical Master Equation is a standard approach to model biochemical reaction networks. It consists of a system of linear differential equations, in which each state corresponds to a possible configuration of the reaction system, and the solution describes a time-dependent probability distribution over all configurations. The Stochastic Simulation Algorithm (SSA) is a method to simulate sample paths from this stochastic process. Both approaches are only applicable for small systems, characterized by few reactions and small numbers of molecules. For larger systems, the CME is computationally intractable due to a large number of possible configurations, and the SSA suffers from large reaction propensities. In our study, we focus on catalytic reaction systems, in which substrates are converted by catalytic molecules. We present an alternative description of these systems, called SiCaSMA, in which the full system is subdivided into smaller subsystems with one catalyst molecule each. These single catalyst subsystems can be analyzed individually, and their solutions are concatenated to give the solution of the full system. We show the validity of our approach by applying it to two test-bed reaction systems, a reversible switch of a molecule and methyltransferase-mediated DNA methylation.


2008 ◽  
Vol 130 (2) ◽  
Author(s):  
W. Habchi ◽  
D. Eyheramendy ◽  
P. Vergne ◽  
G. Morales-Espejel

The solution of the elastohydrodynamic lubrication (EHL) problem involves the simultaneous resolution of the hydrodynamic (Reynolds equation) and elastic problems (elastic deformation of the contacting surfaces). Up to now, most of the numerical works dealing with the modeling of the isothermal EHL problem were based on a weak coupling resolution of the Reynolds and elasticity equations (semi-system approach). The latter were solved separately using iterative schemes and a finite difference discretization. Very few authors attempted to solve the problem in a fully coupled way, thus solving both equations simultaneously (full-system approach). These attempts suffered from a major drawback which is the almost full Jacobian matrix of the nonlinear system of equations. This work presents a new approach for solving the fully coupled isothermal elastohydrodynamic problem using a finite element discretization of the corresponding equations. The use of the finite element method allows the use of variable unstructured meshing and different types of elements within the same model which leads to a reduced size of the problem. The nonlinear system of equations is solved using a Newton procedure which provides faster convergence rates. Suitable stabilization techniques are used to extend the solution to the case of highly loaded contacts. The complexity is the same as for classical algorithms, but an improved convergence rate, a reduced size of the problem and a sparse Jacobian matrix are obtained. Thus, the computational effort, time and memory usage are considerably reduced.


2014 ◽  
Vol 668-669 ◽  
pp. 879-883 ◽  
Author(s):  
Yi Gang Sun ◽  
Li Sun

In order to avoid the complex mathematical modeling and ensure the reliability of avionics system verification, this paper has designed an interfaces emulation and verification platform of avionics system based on QAR data. Platform includes 2 parts: Emulator and Simulator. Simulator generates the flight environmental data which is come from QAR and transforms the data into excitation signal of devices. Emulator emulates the interface features of avionic devices according to the ICD and can be replaced with real devices. By comparing the actual input-output data of devices with QAR theoretical data, this platform can evaluate the running performance of avionic systems or devices and the rationality of the ICD.


2003 ◽  
Vol 68 (5) ◽  
pp. 85-100 ◽  
Author(s):  
C. Bui Thanh ◽  
H. Klaudel ◽  
F. Pommereau

Sign in / Sign up

Export Citation Format

Share Document