Results 1  10
of
934
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
Reveal, A General Reverse Engineering Algorithm For Inference Of Genetic Network Architectures
, 1998
"... Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/o ..."
Abstract

Cited by 344 (5 self)
 Add to MetaCart
far. For n=50 (elements) and k=3 (inputs per element), the analysis of incomplete state transition tables (100 state transition pairs out of a possible 10 15) reliably produced the original rule and wiring sets. While this study is limited to synchronous Boolean
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
Representing Action and Change by Logic Programs
 Journal of Logic Programming
, 1993
"... We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics ..."
Abstract

Cited by 414 (25 self)
 Add to MetaCart
semantics of action based on states and transition functions. 1 Introduction This paper extends the work of Eshghi and Kowalski [6], Evans [7] and Apt and Bezem [1] on representing properties of actions in logic programming languages with negation as failure. Our goal is to overcome some of the limitations
IDENTIFICATION OF GENETIC NETWORKS FROM A SMALL NUMBER OF GENE EXPRESSION PATTERNS UNDER THE BOOLEAN NETWORK MODEL
 PACIFIC SYMPOSIUM ON BIOCOMPUTING 4:1728 (1999)
, 1999
"... ... for inferring genetic network architectures from state transition tables which correspond to time series of gene expression patterns, using the Boolean network model. Their results of computational experiments suggested that a small number of state transition (INPUT/OUTPUT) pairs are sufficient ..."
Abstract

Cited by 254 (17 self)
 Add to MetaCart
... for inferring genetic network architectures from state transition tables which correspond to time series of gene expression patterns, using the Boolean network model. Their results of computational experiments suggested that a small number of state transition (INPUT/OUTPUT) pairs are sufficient
Transition complexity of incomplete dfas
 Fundam. Inform
, 2011
"... In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been obtained. It is shown that the transition complexity results for union and complementation are very different from the ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been obtained. It is shown that the transition complexity results for union and complementation are very different from
Regular Model Checking
, 2000
"... . We present regular model checking, a framework for algorithmic verification of infinitestate systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represented by strings over a finite alphabet and the transition relation by a regular lengthpreserving re ..."
Abstract

Cited by 164 (25 self)
 Add to MetaCart
. We present regular model checking, a framework for algorithmic verification of infinitestate systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represented by strings over a finite alphabet and the transition relation by a regular length
Planning under Incomplete Knowledge
 Proceedings of the First International Conference on Computational Logic (CL2000), volume 1861 of Lecture Notes in Computer Science
, 2000
"... . We propose a new logicbased planning language, called K. Transitions between states of knowledge can be described in K, and the language is well suited for planning under incomplete knowledge. Nonetheless, K also supports the representation of transitions between states of the world (i.e., sta ..."
Abstract

Cited by 38 (7 self)
 Add to MetaCart
. We propose a new logicbased planning language, called K. Transitions between states of knowledge can be described in K, and the language is well suited for planning under incomplete knowledge. Nonetheless, K also supports the representation of transitions between states of the world (i
System Guidelines for Colocated, Collaborative Work on a Tabletop Display
 Proc. ECSCW 2003
, 2003
"... Collaborative interactions with many existing digital tabletop systems lack the fluidity of collaborating around a table using traditional media. This paper presents a critical analysis of the current stateoftheart in digital tabletop systems research, targeted at discovering how user requirement ..."
Abstract

Cited by 148 (4 self)
 Add to MetaCart
Collaborative interactions with many existing digital tabletop systems lack the fluidity of collaborating around a table using traditional media. This paper presents a critical analysis of the current stateoftheart in digital tabletop systems research, targeted at discovering how user
A Logic Programming Approach to KnowledgeState Planning, II: The DLV System
, 2001
"... In Part I of this series of papers, we have proposed a new logicbased planning language, called K. This language facilitates the description of transitions between states of knowledge and it is well suited for planning under incomplete knowledge. Nonetheless, K also supports the representation of t ..."
Abstract

Cited by 106 (34 self)
 Add to MetaCart
In Part I of this series of papers, we have proposed a new logicbased planning language, called K. This language facilitates the description of transitions between states of knowledge and it is well suited for planning under incomplete knowledge. Nonetheless, K also supports the representation
Results 1  10
of
934