Results 1  10
of
1,261
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
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
of states. We describe a general method that represents the state space symbolical/y instead of explicitly. The generality of our method comes from using a dialect of the MuCalculus as the primary specification language. We describe a model checking algorithm for MuCalculus formulas that uses Bryant’s
Learning by Watching: Extracting Reusable Task Knowledge from Visual Observation of Human Performance
 IEEE Transactions on Robotics and Automation
, 1994
"... A novel task instruction method for future intelligent robots is presented. In our method, a robot learns reusable task plans by watching a human perform assembly tasks. Functional units and working algorithms for visual recognition and analysis of human action sequences are presented. The overall s ..."
Abstract

Cited by 298 (6 self)
 Add to MetaCart
system is model based and integrated at the symbolic level. Temporal segmentation of a continuous task performance into meaningful units and identification of each operation is processed in real time by concurrent recognition processes under active attention control. Dependency among assembly operations
Symbolic Equivalence Checking
, 1993
"... . We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition system from an abstract model ; this minimality is relative to an equivalence relation. The method relies on a symbolic representation of the state space. We compute th ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition system from an abstract model ; this minimality is relative to an equivalence relation. The method relies on a symbolic representation of the state space. We compute
Determinacy → (observation equivalence = trace equivalence
 Theoretical Computer Science
, 1985
"... Abstract. If an experiment s is conducted on a parallel process p, then, in general, different processes may result from the experiment, due to the nondeterministic behaviour of p (in the notation of Milner (1980): p ~ p ' for different p'). Process p is called determinate if the resulting ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
denote (the much weaker) failure equivalence, used for CSP (Hoare et al., 1981; Brookes, 1983), and let t denote (the still weaker) trace equivalence. We show that the three corresponding notions of determinacy are the same, and that for determinate processes~, f, and t are the same. Determinacy
Symbolic equivalences for open systems
 Proc. GC’04, LNCS 3267
, 2005
"... Abstract. Behavioural equivalences on open systems are usually defined by comparing system behaviour in all environments. Due to this “universal ” quantification over the possible hosting environments, such equivalences are often difficult to check in a direct way. Here, working in the setting of pr ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
of process calculi, we introduce a hierarchy of behavioural equivalences for open systems, building on a previously defined symbolic approach. The hierarchy comprises both branching, bisimulationbased, and nonbranching, tracebased, equivalences. Symbolic equivalences are amenable to effective analysis
All from one, one for all: on model checking using representatives
 LNCS
, 1993
"... Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences, based ..."
Abstract

Cited by 184 (6 self)
 Add to MetaCart
Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences
Distributed Memory and the Representation of General and Specific Information
, 1985
"... We describe a distributed model of information processing and memory and apply it to the representation of general and specific information. The model consists of a large number of simple processing elements which send excitatory and inhibitory signals to each other via modifiable connections. Infor ..."
Abstract

Cited by 188 (13 self)
 Add to MetaCart
or an enumeration of specific experiences in memory. The model simulates the results of a number of important experiments which have been taken as evidence for the enumeration of specific experiences. At the same time, it shows how the functional equivalent of abstract representations—prototypes, logogens
Automating security analysis: symbolic equivalence of constraint systems
, 2010
"... Abstract. We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity or strong secrecy). Infinite sets of possible traces are symbolically represented using deducibility constrain ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
Abstract. We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity or strong secrecy). Infinite sets of possible traces are symbolically represented using deducibility
A lineartime componentlabeling algorithm using contour tracing technique
 Computer Vision and Image Understanding
, 2004
"... A new linear time algorithm is presented in this article that simultaneously labels connected components (to be referred to merely as components in this paper) and their contours in binary images. The main step of this algorithm is to use a contour tracing technique to detect the external contour ..."
Abstract

Cited by 106 (3 self)
 Add to MetaCart
A new linear time algorithm is presented in this article that simultaneously labels connected components (to be referred to merely as components in this paper) and their contours in binary images. The main step of this algorithm is to use a contour tracing technique to detect the external contour
Results 1  10
of
1,261