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

Abstract: It is important and difficult to identify the Hazard before a disaster happen because disaster often happens suddenly. This paper proposes a new method – State Transition Graph, which based on visual data space reconstruction, to identify hazard. The change process of the system state

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

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

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

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

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

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.

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

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