Results 1  10
of
1,152
Visualisation of State Transition Graphs
, 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 todays 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 Symbolic StateTransition Graph for a Class of Dynamic Petri Nets
"... Abstract—The design of dynamic, adaptable discreteevent 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 discreteevent simulator, Reflective Petri nets are provided in this paper with a semantics defined in terms of labeled statetransitions.
Nested StateTransition Graph Data Sequencing Model With Hierarchical Taxonomy through Radix Coding
"... 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 statetransition graphs. With this statetransition 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, resourceaccessaction, time] records, indicating that the user accesses
A structural analysis of the A5/1 state transition graph∗
"... 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
"... Abstract. Cryptographic generators, e.g. stream cipher generators like the A5/1 used in GSM networks or pseudorandom 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 pseudorandom 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
"... Abstract. Cryptographic generators like the A5/1 are finite state machines with deterministic transition functions. Their state transition graphs cannot be analyzed analytically, nor can they be explored completely 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 machines with deterministic transition functions. Their state transition graphs cannot be analyzed analytically, nor can they be explored completely because of their size which typically is at least n = 264. Yet, their structure, i
An Analysis of CaseBased Value Function Approximation by Approximating State Transition Graphs
"... 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 stateaction value function approximation mechanism that relies on casebased, approximate transition graphs and forms the basis on which the agent improves its
A theory of timed automata
, 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 realtime 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 realtime systems. Its definition provides a simple way to annotate statetransition graphs with timing constraints
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput 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 logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential input
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 327 (7 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends
Results 1  10
of
1,152