An information theoretic approach for knowledge representation using Petri nets

A new hybrid approach for Petri nets (PNs) is proposed in this paper by combining the PNs principles with the foundations of information theory for knowledge representation. The resulting PNs have been named Plausible Petri nets (PPNs) mainly because they can handle the evolution of a discrete event system together with uncertain (plausible) information about the system using states of information. This paper overviews the main concepts of classical PNs and presents a method to allow uncertain information exchange about a state variable within the system dynamics. The resulting methodology is exemplified using an idealized expert system, which illustrates some of the challenges faced in real-world applications of PPNs

Robust Stabilization of Resource Limited Networked Control Systems Under Denial-of-Service Attack

In this paper, we consider a class of denial-of-service (DoS) attacks, which aims at overloading the communication channel. On top of the security issue, continuous or periodic transmission of information within feedback loop is necessary for the effective control and stabilization of the system. In addition, uncertainty---originating from variation of parameters or unmodeled system dynamics---plays a key role in the system's stability. To address these three critical factors, we solve the joint control and security problem for an uncertain discrete-time Networked Control System (NCS) subject to limited availability of the shared communication channel. An event-triggered-based control and communication strategy is adopted to reduce bandwidth consumption. To tackle the uncertainty in the system dynamics, a robust control law is derived using an optimal control approach based on a virtual nominal dynamics associated with a quadratic cost-functional. The conditions for closed-loop stability and aperiodic transmission rule of feedback information are derived using the discrete-time Input-to-State Stability theory. We show that the proposed control approach withstands a general class of DoS attacks, and the stability analysis rests upon the characteristics of the attack signal. The results are illustrated and validated numerically with a classical NCS batch reactor system.Comment: Accepted for IEEE CDC 201

Quantum Measure Theory: A New Interpretation

Quantum measure theory can be introduced as a histories based reformulation (and generalisation) of Copenhagen quantum mechanics in the image of classical stochastic theories. These classical models lend themselves to a simple interpretation in which a single history (a single element of the sample space) is deemed to be 'real'; we require only that this real history should not be ruled out by the dynamics, the axioms of which ensure that not all histories are precluded. However, applying this interpretation naively to quantum measure theory we can find experimentally realisable systems (notably the Peres-Kochen-Specker system) in which every history is ruled out by the dynamics, challenging us to formulate a deeper realist framework. Our first response is to hold on to our existing interpretative framework and attempt a revision of the dynamics that would reduce quantum measure theory to a classical dynamics. We explore this approach by examining the histories formulation of a stochastic-collapse model on a simple (discrete) null-lattice, concluding that the drawbacks of this approach outweigh the benefits. Our second response is to abandon our classically inspired interpretation in favour of Sorkin's 'co-events', a more general ontology that still allows for strict realism. In this case the 'potentially real' objects of the theory (the 'beables' in Bell's language) are not individual histories but truth valuation maps, or co-events. We develop & evaluate various co-event schemes that have been suggested to date, finally adopting the multiplicative scheme; the current working model of co-event theory and a promising interpretation of quantum measure theory, though still a work in progress. We conclude by exploring the expression of the dynamics & predictions in this new framework.Comment: Thesis, 155 page

Models of measurement for quantum fields and for classical continuous random fields

A quantum field model for an experiment describes thermal fluctuations explicitly and quantum fluctuations implicitly, whereas a comparable continuous random field model would describe both thermal and quantum fluctuations explicitly. An ideal classical measurement does not affect the results of later measurements, in contrast to ideal quantum measurements, but we can describe the consequences of the thermal and quantum fluctuations of classically non-ideal measurement apparatuses explicitly. Some details of continuous random fields and of Bell inequalities for random fields will be discussed.Comment: This is a submission for the Proceedings of the Vaxjo Conference on the Foundations of Probability and Physics-4. Comments very welcom

On Quantum Jumps, Events and Spontaneous Localization Models

We propose a definite meaning to the concepts of "experiment", "measurement" and "event" in the event-enhanced formalism of quantum theory. A minimal piecewise deterministic process is given that can be used for a computer simulation of real time series of experiments on single quantum objects. As an example a generalized cloud chamber is described, including multiparticle case. Relation to the GRW spontaneous localization model is discussed. The second revised version of the paper contains references to papers by other authors that are are aiming in the same direction: to enhance quantum theory in such a way that it will provide stochastic description of events triggered by individual quantum systems.Comment: 20 page

State Estimation of Timed Discrete Event Systems and Its Applications

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