Automatic verification method of ATC command repetition based on Siamese network

2021 ◽  
Author(s):  
ZhiHong Wang ◽  
NianSheng Chen ◽  
YiPing Ma ◽  
Lei Rao ◽  
GuangYu Fan
Keyword(s):  
Automatic Verification ◽  
Verification Method ◽  
Siamese Network

scholarly journals On Formal and Automatic Security Verification of WSN Transport Protocols

2014 ◽  
Vol 2014 ◽  
pp. 1-20 ◽  
Author(s):  
Vinh Thong Ta ◽  
Levente Buttyán ◽  
Amit Dvir
Keyword(s):  
Wireless Sensor Networks ◽  
Real Time ◽  
Formal Language ◽  
Process Analysis ◽  
Automatic Verification ◽  
Wireless Sensor ◽  
Behavioral Characteristics ◽  
Transport Protocols ◽  
Verification Method ◽  
Security Verification

We address the problem of formal and automated security verification of transport protocols for wireless sensor networks (WSN) that may perform cryptographic operations. The verification of this class of protocols is difficult because they typically consist of complex behavioral characteristics, such as real-time, probabilistic, and cryptographic operations. To solve this problem, we propose a probabilistic timed calculus for cryptographic protocols and demonstrate how to use this formal language for proving security or vulnerability of protocols. The main advantage of the proposed language is that it supports an expressive syntax and semantics, allowing for studying real-time, probabilistic, and cryptographic issues at the same time. Hence, it can be used to verify systems that involve these three properties in a convenient way. In addition, we propose an automatic verification method, based on the well-known PAT process analysis toolkit, for this class of protocols. For demonstration purposes, we apply the proposed manual and automatic proof methods for verifying the security of DTSN and SDTP, which are two of the recently proposed WSN transport protocols.

scholarly journals A Model Based Security Testing Method for Protocol Implementation

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Yu Long Fu ◽  
Xiao Long Xin
Keyword(s):  
Security Protocol ◽  
Automatic Verification ◽  
Test Cases ◽  
Extended Model ◽  
Security Testing ◽  
Penetration Testing ◽  
Protocol Implementation ◽  
Verification Method ◽  
Testing Method ◽  
Specific Protocol

The security of protocol implementation is important and hard to be verified. Since the penetration testing is usually based on the experience of the security tester and the specific protocol specifications, a formal and automatic verification method is always required. In this paper, we propose an extended model of IOLTS to describe the legal roles and intruders of security protocol implementations, and then combine them together to generate the suitable test cases to verify the security of protocol implementation.

scholarly journals Parametric Verification of a Group Membership Algorithm

2006 ◽  
Vol 6 (3) ◽  
pp. 321-353 ◽  
Author(s):  
AHMED BOUAJJANI ◽  
AGATHE MERCERON
Keyword(s):  
Arbitrary Number ◽  
Group Membership ◽  
Automatic Verification ◽  
Verification Method

We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to communicate. It has many mechanisms to ensure robustness to faults. In particular, it has an algorithm that allows a station to recognize itself as faulty and leave the communication. This algorithm must satisfy the crucial ‘non-clique’ property: it is impossible to have two or more disjoint groups of stations communicating exclusively with stations in their own group. In this paper, we propose an automatic verification method for an arbitrary number of stations $N$ and a given number of faults $k$. We give an abstraction that allows to model the algorithm by means of unbounded (parametric) counter automata. We have checked the non-clique property on this model in the case of one fault, using the ALV tool as well as the LASH tool.

scholarly journals AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS

2011 ◽  
Vol 22 (04) ◽  
pp. 761-782 ◽  
Author(s):  
PAROSH AZIZ ABDULLA ◽  
GIORGIO DELZANNO ◽  
AHMED REZINE
Keyword(s):  
Arbitrary Number ◽  
Symbolic Representation ◽  
Reachability Analysis ◽  
Automatic Verification ◽  
Client Server ◽  
Verification Method ◽  
Graph Transformations ◽  
Access Rights ◽  
Graph Constraints ◽  
Symbolic Verification

We propose a symbolic verification method for directory-based consistency protocols working for an arbitrary number of controlled resources and competing processes. We use a graph-based language to specify in a uniform way both client/server interaction schemes and manipulation of directories that contain the access rights of individual clients. Graph transformations model the dynamics of a given protocol. Universally quantified conditions defined on the labels of edges incident to a given node are used to model inspection of directories, invalidation loops and integrity conditions. Our verification procedure computes an approximated backward reachability analysis by using a symbolic representation of sets of configurations. Termination is ensured by using the theory of well-quasi orderings.

Design of the Time Interval Generator Automatic Verification and Management System

2012 ◽  
Vol 605-607 ◽  
pp. 1099-1104
Author(s):  
Yong Jie Fu ◽  
Xing Bo Hou
Keyword(s):  
Working Condition ◽  
Automatic Verification ◽  
Time Interval ◽  
Practical Application ◽  
Standard Equipment ◽  
Verification Method ◽  
Result Show ◽  
Design Requirements ◽  
Low Efficiency ◽  
Manual Test

This paper is aimed at the matter that verification method of time interval generator is still manual test, low efficiency, heavy workload, and for mechanical stopwatch calibrator can not be test because of lack of a machine / electrical converter. The author developed a machine/electrical switch, and programmed the automatic verification and management software using VB language, which realized the automatic verification and information management for various types of time interval generator. The machine/electrical switch is tested by NIM, the result show that the main indexes meet the design requirements. By practical application, the system has been working condition, which can be used as standard equipment of time and frequency parameter.

Texture measurements in Al2O3 using BEKP

1994 ◽  
Vol 52 ◽  
pp. 608-609
Author(s):  
M. D. Vaudin ◽  
J. P. Cline
Keyword(s):  
Neutron Diffraction ◽  
Rapid Method ◽  
Crystallographic Orientation ◽  
Specimen Surface ◽  
X Ray Diffraction ◽  
Anisotropic Crystal ◽  
X Ray ◽  
Verification Method ◽  
Crystal Properties ◽  
Backscattered Electron

The study of preferred crystallographic orientation (texture) in ceramics is assuming greater importance as their anisotropic crystal properties are being used to advantage in an increasing number of applications. The quantification of texture by a reliable and rapid method is required. Analysis of backscattered electron Kikuchi patterns (BEKPs) can be used to provide the crystallographic orientation of as many grains as time and resources allow. The technique is relatively slow, particularly for noncubic materials, but the data are more accurate than any comparable technique when a sufficient number of grains are analyzed. Thus, BEKP is well-suited as a verification method for data obtained in faster ways, such as x-ray or neutron diffraction. We have compared texture data obtained using BEKP, x-ray diffraction and neutron diffraction. Alumina specimens displaying differing levels of axisymmetric (0001) texture normal to the specimen surface were investigated.BEKP patterns were obtained from about a hundred grains selected at random in each specimen.

Sign in / Sign up

Export Citation Format

Share Document