Results 1  10
of
4,716,668
Labelled state transition systems
 Formalized Mathematics
"... Summary. This article introduces labelled state transition systems, where transitions may be labelled by words from a given alphabet. Reduction relations from [4] are used to define transitions between states, acceptance of words, and reachable states. Deterministic transition systems are also defin ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Summary. This article introduces labelled state transition systems, where transitions may be labelled by words from a given alphabet. Reduction relations from [4] are used to define transitions between states, acceptance of words, and reachable states. Deterministic transition systems are also
Interactive Visualization of State Transition Systems
 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
, 2002
"... A new method for the visualization of state transition systems is presented. Visual information is reduced by clustering nodes, forming a tree structure of related clusters. This structure is visualized in three dimensions with concepts from cone trees and emphasis on symmetry. A number of interacti ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
A new method for the visualization of state transition systems is presented. Visual information is reduced by clustering nodes, forming a tree structure of related clusters. This structure is visualized in three dimensions with concepts from cone trees and emphasis on symmetry. A number
Deductive Verification of Invariants of StateTransition Systems
"... . We present a modular technique to prove invariants of statetransition systems in a deductive framework. We show how the semantic knowledge of the given problem can be generically used to decompose the problem into modular tasks which can be successfully tackled with the help of techniques deve ..."
Abstract
 Add to MetaCart
developed in the field of inductive theorem proving. As an example we present the mechanical verification of the invariant of a case study specifying a generic elevator. 1 Introduction Statetransition systems are commonly used to specify reactive systems. They are based on a view of a global state
The Generation of Animated Sequences from State Transition Systems
"... We address the issue of the construction of a computer animation system by composing together a collection of behaviours for the individual objects which are to be animated. The behaviours are developed using a formal notation for state transition systems. The notation is particularly flexible, allo ..."
Abstract
 Add to MetaCart
We address the issue of the construction of a computer animation system by composing together a collection of behaviours for the individual objects which are to be animated. The behaviours are developed using a formal notation for state transition systems. The notation is particularly flexible
Simulating dialogues with finite state transition systems
"... In this paper we contribute to Dialogue Theory introducing two formal frameworks inspired in Formal Language Theory, for the simulation of dialogues as finite state transition systems. In the first framework agents are provided with a share memory limited to an stack of locutions. An stack proves t ..."
Abstract
 Add to MetaCart
In this paper we contribute to Dialogue Theory introducing two formal frameworks inspired in Formal Language Theory, for the simulation of dialogues as finite state transition systems. In the first framework agents are provided with a share memory limited to an stack of locutions. An stack proves
Virtual Time and Global States of Distributed Systems
 PARALLEL AND DISTRIBUTED ALGORITHMS
, 1988
"... A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized "real world" and helps to solve problems like getting a consiste ..."
Abstract

Cited by 741 (6 self)
 Add to MetaCart
A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized "real world" and helps to solve problems like getting a
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
The implementation of interactive local state transition systems in Clean
 Proceedings 11th International Workshop Implementation of Functional Languages, IFL'99
, 1999
"... . The functional programming language Clean offers an extensive library, the object I/O library, to programmers to create interactive applications that use Graphical User Interfaces (GUI). Programs are constructed by composition of interactive objects. Interactive objects share state. To support ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
. The functional programming language Clean offers an extensive library, the object I/O library, to programmers to create interactive applications that use Graphical User Interfaces (GUI). Programs are constructed by composition of interactive objects. Interactive objects share state
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 753 (40 self)
 Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number
Antide Sitter Space, Thermal Phase Transition, and Confinement in Gauge Theories
 Adv. Theor. Math. Phys
, 1998
"... The correspondence between supergravity (and string theory) on AdS space and boundary conformal field theory relates the thermodynamics of N = 4 super YangMills theory in four dimensions to the thermodynamics of Schwarzschild black holes in Antide Sitter space. In this description, quantum phenome ..."
Abstract

Cited by 1087 (4 self)
 Add to MetaCart
The correspondence between supergravity (and string theory) on AdS space and boundary conformal field theory relates the thermodynamics of N = 4 super YangMills theory in four dimensions to the thermodynamics of Schwarzschild black holes in Antide Sitter space. In this description, quantum phenomena such as the spontaneous breaking of the center of the gauge group, magnetic confinement, and the mass gap are coded in classical geometry. The correspondence makes it manifest that the entropy of a very large AdS Schwarzschild black hole must scale “holographically ” with the volume of its horizon. By similar methods, one can also make a speculative proposal for the description of large N gauge theories in four dimensions without supersymmetry. March
Results 1  10
of
4,716,668