912 research outputs found

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    An Independent Timing Analysis for Credit-Based Shaping in Ethernet TSN

    Get PDF

    (b2023 to 2014) The UNBELIEVABLE similarities between the ideas of some people (2006-2016) and my ideas (2002-2008) in physics (quantum mechanics, cosmology), cognitive neuroscience, philosophy of mind, and philosophy (this manuscript would require a REVOLUTION in international academy environment!)

    Get PDF
    (b2023 to 2014) The UNBELIEVABLE similarities between the ideas of some people (2006-2016) and my ideas (2002-2008) in physics (quantum mechanics, cosmology), cognitive neuroscience, philosophy of mind, and philosophy (this manuscript would require a REVOLUTION in international academy environment!

    An Independent Timing Analysis for Credit-Based Shaping in Ethernet TSN

    Get PDF

    Go-MC - An implementation level model checker for Go

    Get PDF
    Implementation level model checkers haven proven a good tool for identifying bugs in implementations of distributed algorithms. In recent years many new model checkers have been developed. These often include new state space reduction techniques which increase their effectiveness, but they are often locked to use a specific state space reduction technique and to support specific abstractions. This makes it hard to compare different state space reduction techniques and to change between different abstractions. We propose Go-MC, a modular implementation level model checker for the Go programming language. Go-MC consists of four modules: the Scheduler, the State Manager, the Checker and the Failure Manager. Each module can easily be swapped for different implementations, which makes it easy to change between different abstractions and scheduling techniques. Go-MC also uses Event Managers to control the execution of the algorithm. Event Managers are flexible and custom implementations can be made to utilize specific frameworks or to mock components of distributed systems. This allows us to take a modular approach when simulating distributed systems, which will reduce the number of events in a simulation and thus reduce the size of the state space. It also makes it possible to efficiently capture events and support different frameworks

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum

    State Estimation of Timed Discrete Event Systems and Its Applications

    Get PDF
    Many industrial control systems can be described as discrete event systems (DES), whose state space is a discrete set where event occurrences cause transitions from one state to another. Timing introduces an additional dimension to DES modeling and control. This dissertation provides two models of timed DES endowed with a single clock, namely timed finite automata (TFA) and generalized timed finite automata (GTFA). In addition, a timing function is defined to associate each transition with a time interval specifying at which clock values it may occur. While the clock of a TFA is reset to zero after each event occurs and the time semantics constrain the dwell time at each discrete state, there is an additional clock resetting function associated with a GTFA to denote whether the clock is reset to a value in a given closed time interval. We assume that the logical and time structure of a partially observable TFA/GTFA is known. The main results are summarized as follows. 1. The notion of a zone automaton is introduced as a finite automaton providing a purely discrete event description of the behaviour of a TFA/GTFA of interest. Each state of a zone automaton contains a discrete state of the timed DES and a zone that is a time interval denoting a range of possible clock values. We investigate the dynamics of a zone automaton and show that one can reduce the problem of investigating the reachability of a given timed DES to the reachability analysis of a zone automaton. 2. We present a formal approach that allows one to construct offline an observer for TFA/GTFA, i.e., a finite structure that describes the state estimation for all possible evolutions. During the online phase to estimate the current discrete state according to each measurement of an observable event, one can determine which is the state of the observer reached by the current observation and check to which interval (among a finite number of time intervals) the time elapsed since the last observed event occurrence belongs. We prove that the discrete states consistent with a timed observation and the range of clock values associated with each estimated discrete state can be inferred following a certain number of runs in the zone automaton. In particular, the state estimation of timed DES under multiple clocks can be investigated in the framework of GTFA. We model such a system as a GTFA with multiple clocks, which generalizes the timing function and the clock resetting function to multiple clocks. 3. As an application of the state estimation approach for TFA, we assume that a given TFA may be affected by a set of faults described using timed transitions and aim at diagnosing a fault behaviour based on a timed observation. The problem of fault diagnosis is solved by constructing a zone automaton of the TFA with faults and a fault recognizer as the parallel composition of the zone automaton and a fault monitor that recognizes the occurrence of faults. We conclude that the occurrence of faults can be analyzed by exploring runs in the fault recognizer that are consistent with a given timed observation. 4. We also study the problem of attack detection in the context of DESs, assuming that a system may be subject to multiple types of attacks, each described by its own attack dictionary. Furthermore, we distinguish between constant attacks, which corrupt observations using only one of the attack dictionaries, and switching attacks, which may use different attack dictionaries at different steps. The problem we address is detecting whether a system has been attacked and, if so, which attack dictionaries have been used. To solve it in the framework of untimed DES, we construct a new structure that describes the observations generated by a system under attack. We show that the attack detection problem can be transformed into a classical state estimation/diagnosis problem for these new structures

    Secure Harmonized Speed Under Byzantine Faults for Autonomous Vehicle Platoons Using Blockchain Technology

    Get PDF
    Autonomous Vehicle (AV) platooning holds the promise of safer and more efficient road transportation. By coordinating the movements of a group of vehicles, platooning offers benefits such as reduced energy consumption, lower emissions, and improved traffic flow. However, the realization of these advantages hinges on the ability of platooning vehicles to reach a consensus and maintain secure, cooperative behavior. Byzantine behavior [1,2], characterized by vehicles transmitting incorrect or conflicting information, threatens the integrity of platoon coordination. Vehicles within the platoon share vital data such as position, speed, and other relevant information to optimize their operation, ensuring safe and efficient driving. However, Byzantine behavior in AV platoons presents a critical challenge by disrupting coordinated operations. Consequently, the malicious transmission of conflicting information can lead to safety compromises, traffic disruptions, energy inefficiency, loss of trust, chain reactions of faults, and legal complexities [3,4]. In this light, this thesis delves into the challenges posed by Byzantine behavior within platoons and presents a robust solution using ConsenCar; a blockchain-based protocol for AV platoons which aims to address Byzantine faults in order to maintain reliable and secure platoon operations. Recognizing the complex obstacles presented by Byzantine faults in these critical real-time systems, this research exploits the potential of blockchain technology to establish Byzantine Fault Tolerance (BFT) through Vehicle-to-Vehicle (V2V) communications over a Vehicular Ad hoc NETwork (VANET). The operational procedure of ConsenCar involves several stages, including proposal validation, decision-making, and eliminating faulty vehicles. In instances such as speed harmonization, the decentralized network framework enables vehicles to exchange messages to ultimately agree on a harmonized speed that maximizes safety and efficiency. Notably, ConsenCar is designed to detect and isolate vehicles displaying Byzantine behavior, ensuring that their actions do not compromise the integrity of decision-making. Consequently, ConsenCar results in a robust assurance that all non-faulty vehicles converge on unanimous decisions. By testing ConsenCar on the speed harmonization operation, simulation results indicate that under the presence of Byzantine behavior, the protocol successfully detects and eliminates faulty vehicles, provided that more than two-thirds of the vehicles are non-faulty. This allows non-faulty vehicles to achieve secure harmonized speed and maintain safe platoon operations. As such, the protocol generalizes to secure other platooning operations, including splitting and merging, intersection negotiation, lane-changing, and others. The implications of this research are significant for the future of AV platooning, as it establishes BFT to enhance the safety, efficiency, and reliability of AV transportation, therefore paving the way for improved security and cooperative road ecosystems
    • …
    corecore