Results 1  10
of
202,798
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
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 758 (41 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
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
Statecharts: A Visual Formalism For Complex Systems
, 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract

Cited by 2704 (56 self)
 Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we
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
Distributed Snapshots: Determining Global States of Distributed Systems
 ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1985
"... This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to s ..."
Abstract

Cited by 1208 (6 self)
 Add to MetaCart
This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps
Results 1  10
of
202,798