Results 1 - 10 of 46,171

Visualisation of State Transition Graphs

by Frank van Ham, Advisor M. A. Reniers , 2000
"... Although graph drawing and graph visualisation have often been the subject of research, most of this research focuses on creating tidier drawings of relatively small graphs. However, in today’s complex society, research into the visualisation of large graphs is becoming increasingly important. One c ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
can think of maps of the entire internet or call graphs for very large software programs, for example. This thesis presents a visualisation method for a class of large graphs called state transition graphs. State transition graphs can be used as a mathematical description for processes or programs

A structural analysis of the A5/1 state transition graph∗

by A. J. Wijs, C A. Beckmann, J. Fedorowicz, J. Keller, U. Meyer, Andreas Beckmann, Jaroslaw Fedorowicz, Jörg Keller, Ulrich Meyer
"... We describe efficient algorithms to analyze the cycle structure of the graph induced by the state transition function of the A5/1 stream cipher used in GSM mobile phones and report on the results of the implementation. The analysis is performed in five steps utilizing HPC clusters, GPGPU and externa ..."
Abstract - Add to MetaCart
We describe efficient algorithms to analyze the cycle structure of the graph induced by the state transition function of the A5/1 stream cipher used in GSM mobile phones and report on the results of the implementation. The analysis is performed in five steps utilizing HPC clusters, GPGPU

Efficient Sampling of the Structure of Crypto Generators ’ State Transition Graphs

by unknown authors
"... Abstract. Cryptographic generators, e.g. stream cipher generators like the A5/1 used in GSM networks or pseudo-random number generators, are widely used in cryptographic network protocols. Basically, they are finite state machines with deterministic transition functions. Their state transition graph ..."
Abstract - Add to MetaCart
Abstract. Cryptographic generators, e.g. stream cipher generators like the A5/1 used in GSM networks or pseudo-random number generators, are widely used in cryptographic network protocols. Basically, they are finite state machines with deterministic transition functions. Their state transition

Efficient Sampling of the Structure of Cryptographic Generators ’ State Transition Graphs

by unknown authors
"... Abstract. Cryptographic generators like the A5/1 are finite state ma-chines with deterministic transition functions. Their state transition graphs cannot be analyzed analytically, nor can they be explored com-pletely because of their size which typically is at least n = 264. Yet, their structure, i. ..."
Abstract - Add to MetaCart
Abstract. Cryptographic generators like the A5/1 are finite state ma-chines with deterministic transition functions. Their state transition graphs cannot be analyzed analytically, nor can they be explored com-pletely because of their size which typically is at least n = 264. Yet, their structure, i

Construction of abstract state graphs with PVS

by Susanne Graf, Hassen Saidi , 1997
"... We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonab ..."
Abstract - Cited by 742 (10 self) - Add to MetaCart
We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a

An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs

by Thomas Gabel, Martin Riedmiller
"... Abstract. We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link concerns the utmost efficient exploitation of experience the agent has collected by interacting within its enviro ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
environment, while the second relates to the acquisition and representation of a suitable behavior policy. Combining both connections, we develop a state-action value function approximation mechanism that relies on case-based, approximate transition graphs and forms the basis on which the agent improves its

A Symbolic State-Transition Graph for a Class of Dynamic Petri Nets

by Lorenzo Capra
"... Abstract—The design of dynamic, adaptable discrete-event systems calls for adequate modeling formalisms and tools in order to manage possible changes occurring during system’s lifecycle. A common approach is to pollute the design with details not concerning the current system behavior, rather its ev ..."
Abstract - Add to MetaCart
the short time) of a discrete-event simulator, Reflective Petri nets are provided in this paper with a semantics defined in terms of labeled state-transitions.

SIS: A System for Sequential Circuit Synthesis

by Ellen M. Sentovich, Kanwar Jit Singh, Luciano Lavagno, Cho Moon, Rajeev Murgai, Alexander Saldanha, Hamid Savoj, Paul R. Stephan, Robert K. Brayton, Alberto Sangiovanni-Vincentelli , 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logic-level description of a sequential circuit, it produces an optimized net-list in the target technology while preserving the sequential input-output b ..."
Abstract - Cited by 527 (44 self) - Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logic-level description of a sequential circuit, it produces an optimized net-list in the target technology while preserving the sequential input

Nested State-Transition Graph Data Sequencing Model With Hierarchical Taxonomy through Radix Coding

by Jia-sheng Heh, Shein-yun Cheng, Chang-kai Hsu
"... The Internet enables all electronic information to be connected through communication networks. Users access these Internet resources with different behavior models. This paper proposes a systematic data mining approach to studying users ' Internet resource access actions to find out behavior m ..."
Abstract - Add to MetaCart
models as state-transition graphs. With this state-transition graph model, it is possible to predict the future behaviors of different user communities. A series of Internet resource access actions are stored in a database of [user, resource-access-action, time] records, indicating that the user accesses

A theory of timed automata

by Rajeev Alur , 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract - Cited by 2651 (32 self) - Add to MetaCart
of real-time systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of real-time systems. Its definition provides a simple way to annotate state-transition graphs with timing constraints
Results 1 - 10 of 46,171