329BASICS Model: Check and Sustain 1

2018 ◽  
pp. 329-338
Author(s):  
Protzman Charles ◽  
Whiton Fred ◽  
Protzman Dan
Keyword(s):  
2014 ◽  
Vol 1036 ◽  
pp. 499-504 ◽  
Author(s):  
Octavian Alexa ◽  
Marin Marinescu ◽  
Marian Truta ◽  
Radu Vilau ◽  
Valentin Vinturis

The simulation procedure has always been considered as a giant leap forward, especially in the field of basic designing of a product. There is nothing new underneath the basic concept, but the scientific and technical progress always brings up new techniques that improve simulation in its whole. When we talk about a vehicle, especially about a military one, we consider that it is much cheaper to simulate a process involving the weapon system than performing countless tests that are rather expensive. In this respect, we tried to develop a simulation mathematical model, check its accuracy with a set of extensive tests, prove it reliability and further extrapolate the behavior of the simulated model to a larger number of military vehicles of the same kind. It could help in various fields, such as diagnose (by comparing the simulated results with the real ones got from a faulty vehicle) or automatically regulating some functions (an intelligent vehicle, having an implemented, simulated model, that is able to feel the status of a subsystem in real time and regulate its behavior, accordingly). Hence, the paper presents a model that simulates the longitudinal dynamics of a tracked vehicle. It has been issued using Simulink module of Matlab programming environment. It aims at pointing out the performances of the vehicle. The models interface is friendly and its structure is modular. The main modules of the model are the engine, the torque converter, the transmission and the track. The engine and the torque converter are modeled using the experimental maps obtained by the tests that have been previously developed by the manufacturer. The main principle of the equations that describe the system is to set a balance among the forces (both active and resistive) that load the vehicle. The inputs of the model are the technical and dimensional features, provided by the manufacturer or experimentally determined. The output of the model is a dynamic behavior. Comparing the results with the experimental data eventually validates or invalidates the model. But the results were excellent, so the model was validated. Also, the results proved that the developed model is able to predict the performances of the take-off stage of the tracked vehicle.


Author(s):  
Kazuhiro Ogata

The paper describes how to formally specify three path finding algorithms in Maude, a rewriting logic-based programming/specification language, and how to model check if they enjoy desired properties with the Maude LTL model checker. The three algorithms are Dijkstra Shortest Path Finding Algorithm (DA), A* Algorithm and LPA* Algorithm. One desired property is that the algorithms always find the shortest path. To this end, we use a path finding algorithm (BFS) based on breadth-first search. BFS finds all paths from a start node to a goal node and the set of all shortest paths is extracted. We check if the path found by each algorithm is included in the set of all shortest paths for the property. A* is an extension of DA in that for each node [Formula: see text] an estimation [Formula: see text] of the distance to the goal node from [Formula: see text] is used and LPA* is an incremental version of A*. It is known that if [Formula: see text] is admissible, A* always finds the shortest path. We have found a possible relaxed sufficient condition. The relaxed condition is that there exists the shortest path such that for each node [Formula: see text] except for the start node on the path [Formula: see text] plus the cost to [Formula: see text] from the start node is less than the cost of any non-shortest path to the goal from the start. We informally justify the relaxed condition. For LPA*, if the relaxed condition holds in each updated version of a graph concerned including the initial graph, the shortest path is constructed. Based on the three case studies for DA, A* and LPA*, we summarize the formal specification and model checking techniques used as a generic approach to formal specification and model checking of path finding algorithms.


Author(s):  
Hidefumi Wakamatsu ◽  
Kyosuke Shirai ◽  
Eiji Morinaga ◽  
Takahiro Kubo

Abstract A general method is proposed to predict the shape of a paper model of a brassiere cup. A brassiere cup consists of several cloth and wire parts and the shapes of cloth parts are determined by repeating creation of a paper cup model, check of its 3D shape, and modification of 2D shapes of parts. For efficient design of a brassiere cup, prediction of its 3D shape with a simulation is required. The deformed shape of a paper part is represented as a single or multiple developable surfaces. So, a model that can represent a part both as a single surface and as multiple surfaces is proposed. Which case is selected depends on the magnitude of the potential energy of the part in each case. The potential energy of the part and geometric constraints imposed on the part are formulated based on the model. Minimizing the potential energy under geometric constraints derives the stable shape of the part in either case. Furthermore, our proposed method can be applied to prediction of the paper cup model consisting of parts with complex shapes.


10.29007/slnn ◽  
2018 ◽  
Author(s):  
Timothy L. Hinrichs ◽  
A. Prasad Sistla ◽  
Lenore D. Zuck

Model checking and runtime verification are pillars of formal verification but for the most part are used independently. In this position paper we argue that the formal verification community would be well-served by developing theory, algorithms, implementations, and applications that combine model checking and runtime verification into a single, seamless technology. This technology would allow system developers to carefully choose the appropriate balance between offline verification of expressive properties (model checking) and online verification of important parts of the system's state space (runtime verification). We present several realistic examples where such technology appears necessary and a preliminary formalization of the idea.


Author(s):  
Karsten Stahl ◽  
Kai Baukus ◽  
Yassine Lakhnech ◽  
Martin Stefen
Keyword(s):  

Author(s):  
Protzman Charles ◽  
Protzman Dan ◽  
Keen William
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document