Execution time monitoring and interrupt handlers

Background & Objective: Cryptographic protocols had been evident method for ensuring con dentiality, Integrity and authentication in various digital communication systems. However the validation and analysis of such cryptographic protocols was limited to usage of formal mathematical models until few years back. Methods: In this paper, various popular cryptographic protocols have been studied. Some of these protocols (PAP, CHAP, and EAP) achieve security goals in peer to peer communication while others (RADIUS, DIAMETER and Kerberos) can work in multiparty environment. These protocols were validated and analysed over two popular security validation and analysis tools AVISPA and Scyther. The protocols were written according to their documentation using the HLPSL and SPDL for analysis over AVISPA and Scyther respectively. The results of these tools were analysed to nd the possible attack an each protocol. Afterwards The execution time analysis of the protocols were done by repeating the experiment for multiple iterations over the command line versions of these tools.As the literature review suggested, this research also validates that using password based protocols (PAP) is faster in terms of execution time as compared to other methods, Usage of nonces tackles the replay attack and DIAMETER is secure than RADIUS. Results and Conclusion: The results also showed us that DIAMETER is faster than RADIUS. Though Kerberos protocol was found to safe, the results tell us that it is compromisable under particular circumstances.

Download Full-text

Transparent distribution of real-time components based on logical execution time

Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems - LCTES'05 ◽

10.1145/1065910.1065915 ◽

2005 ◽

Cited By ~ 21

Author(s):

Emilia Farcas ◽

Claudiu Farcas ◽

Wolfgang Pree ◽

Josef Templ

Keyword(s):

Real Time ◽

Execution Time

Download Full-text

System-Level Logical Execution Time: Augmenting the Logical Execution Time Paradigm for Distributed Real-Time Automotive Software

ACM Transactions on Cyber-Physical Systems ◽

10.1145/3381847 ◽

2020 ◽

Author(s):

Kai-Björn Gemlau ◽

Leonie Köhler ◽

Rolf Ernst ◽

Sophie Quinton

Keyword(s):

Real Time ◽

Execution Time ◽

System Level ◽

Automotive Software

Download Full-text

Indoor Path-Planning Algorithm for UAV-Based Contact Inspection

Sensors ◽

10.3390/s21020642 ◽

2021 ◽

Vol 21 (2) ◽

pp. 642

Author(s):

Luis Miguel González de Santos ◽

Ernesto Frías Nores ◽

Joaquín Martínez Sánchez ◽

Higinio González Jorge

Keyword(s):

Path Planning ◽

Real Time ◽

Execution Time ◽

Point Cloud ◽

Indoor Environments ◽

Calculation Algorithm ◽

Time Restrictions ◽

Planning Algorithm ◽

Inspection Tasks ◽

Path Planning Algorithm

Nowadays, unmanned aerial vehicles (UAVs) are extensively used for multiple purposes, such as infrastructure inspections or surveillance. This paper presents a real-time path planning algorithm in indoor environments designed to perform contact inspection tasks using UAVs. The only input used by this algorithm is the point cloud of the building where the UAV is going to navigate. The algorithm is divided into two main parts. The first one is the pre-processing algorithm that processes the point cloud, segmenting it into rooms and discretizing each room. The second part is the path planning algorithm that has to be executed in real time. In this way, all the computational load is in the first step, which is pre-processed, making the path calculation algorithm faster. The method has been tested in different buildings, measuring the execution time for different paths calculations. As can be seen in the results section, the developed algorithm is able to calculate a new path in 8–9 milliseconds. The developed algorithm fulfils the execution time restrictions, and it has proven to be reliable for route calculation.

Download Full-text