Browsing by Subject "Finite automata"
Now showing items 120 of 26

Article
Aliasing probability calculations for arbitrary compaction under independently selected random test vectors
(2005)This paper discusses a systematic methodology for calculating the exact aliasing probability associated with schemes that use an arbitrary finitestate machine to compact the response of a combinational circuit to a sequence ...

Conference Object
Aliasing probability calculations in nonlinear compactors
(2003)This paper discusses a systematic methodology for calculating the aliasing probability when an arbitrary finitestate machine is used to compact the response of a combinational circuit to a sequence of randomly generated ...

Article
Currentstate opacity formulations in probabilistic finite automata
(2014)A system is said to be currentstate opaque if the entrance of the system state to a set of secret states remains opaque (uncertain) to an intruder  at least until the system leaves the set of secret states. This notion ...

Conference Object
Decentralized failure diagnosis in discrete event systems
(2006)In this paper, we develop and analyze decentralized failure diagnosis schemes for systems that can be modeled as finite state machines (FSMs). We consider a scenario where we are given multiple local diagnosers (with partial ...

Article
Encoded dynamics for fault tolerance linear finitestate machines
(2002)This note discusses fault tolerance in linear finitestate machines (LFSMs). By replacing a given LFSM with a larger, redundant LFSM that preserves the state of the original one in some linearly encoded form, various ...

Conference Object
Encoded finitestate machines for nonconcurrent error detection and identification
(2003)In this paper we develop a methodology for systematically constructing redundant finitestate machines in a way that enables an external mechanism to detect and identify transient statetransition faults by performing ...

Article
Finitestate machine embeddings for nonconcurrent error detection and identification
(2005)In digital sequential systems that operate over several time steps, a statetransition fault at any time step during the operation of the system can corrupt its state and render its future functionality useless. Such ...

Conference Object
Initial state opacity in stochastic des
(2013)A nondeterministic finite automaton is initialstate opaque if the membership of its true initial state to a given set of secret states S remains opaque (i.e., uncertain) to an intruder who observes system activity through ...

Conference Object
Kdetectability in discrete event systems
(Institute of Electrical and Electronics Engineers Inc., 2016)This paper studies observability in discrete event systems (DES), and introduces and analyzes the property of Kdetectability. In particular, a given DES is strongly Kdetectable if eventually (after a finite number of ...

Conference Object
Maximum likelihood diagnosis in partially observable finite state machines
(2005)In this paper we develop a probabilistic approach for fault diagnosis in deterministic finite state machines (FSMs). The proposed approach determines whether the FSM under consideration is faulty or not by observing (part ...

Article
Maximum likelihood failure diagnosis in finite state machines under unreliable observations
(2010)In this paper, we develop a probabilistic methodology for failure diagnosis in finite state machines based on a sequence of unreliable observations. Given prior knowledge of the input probability distribution but without ...

Article
On the complexity of parallelizing sequential circuits using the parallelprefix method
(2001)The parallelprefix method uses a tree of identical processing nodes to calculate in parallel, the state and output response of a finitestate machine (FSM) to a finitelength input sequence. Traditionally, each computing ...

Conference Object
Opacity formulations and verification in discrete event systems
(Institute of Electrical and Electronics Engineers Inc., 2014)In many emerging security applications, a property of a system, that may reveal important details about its behaviour, needs to be kept secret (opaque) to outside observers (intruders). Motivated by such applications, ...

Conference Object
Opacity verification in stochastic discrete event systems
(2010)Motivated by security and privacy considerations in applications of discrete event systems, various notions of opacity have been introduced. Specifically, a system is said to be currentstate opaque if the entrance of the ...

Article
Probabilistic approaches to fault detection in networked discrete event systems
(2005)In this paper, we consider distributed systems that can be modeled as finite state machines with known behavior under faultfree conditions, and we study the detection of a general class of faults that manifest themselves ...

Article
Probabilistic detection of FSM single statetransition faults based on state occupancy measurements
(2005)This note discusses a probabilistic methodology for detecting single permanent or transient functional changes in the statetransition mechanism of a deterministic finitestate machine (FSM). The associated probabilistic ...

Conference Object
Probabilistic failure diagnosis in finite state machines under unreliable observations
(2006)In this paper we develop a probabilistic methodology for calculating the likelihood that an observed, possibly corrupted event sequence was generated by two (or more) candidate finite state machines (FSMs) (one of which ...

Conference Object
Probabilistic fault detection in finitestate machines based on state occupancy measurements
(2002)This paper discusses a probabilistic methodology for detecting permanent or transient functional changes in the statetransition mechanism of a deterministic finitestate machine (FSM). The associated detector observes the ...

Article
Probabilistic system opacity in discrete event systems
(2018)In many emerging security applications, a system designer frequently needs to ensure that a certain property of a given system (that may reveal important details about the system’s operation) be kept secret (opaque) to ...

Conference Object
Reducedcomplexity verification for initialstate opacity in modular discrete event systems
(2010)In this paper, we propose and analyze reducedcomplexity methodologies for verifying initialstate opacity in modular discrete event systems. Initialstate opacity requires that the membership of the system initial state ...