Results 1  10
of
73,608
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
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 680 (13 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
Creative Commons Attribution License. Simulation of TwoWay Pushdown Automata Revisited
"... The lineartime simulation of 2way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semanticsbased approach by Jones, an interpreter is given which, when extended with randomaccess memory, performs a lineartime simulation of 2DPDA. The recur ..."
Abstract
 Add to MetaCart
The lineartime simulation of 2way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semanticsbased approach by Jones, an interpreter is given which, when extended with randomaccess memory, performs a lineartime simulation of 2DPDA
Pushdown automata
"... This chapter introduces Pushdown Automata, and presents their basic theory. The two language families defined by pda (acceptance by final state, resp. by empty stack) are shown to be equal. The pushdown languages are shown to be equal to the contextfree languages. Closure properties of the context ..."
Abstract
 Add to MetaCart
This chapter introduces Pushdown Automata, and presents their basic theory. The two language families defined by pda (acceptance by final state, resp. by empty stack) are shown to be equal. The pushdown languages are shown to be equal to the contextfree languages. Closure properties of the context
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Deterministic Pushdown Automata and Unary Languages
, 2009
"... The simulation of deterministic pushdown automata defined over a oneletter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be simulated by a deterministic finite automaton with a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
number of states that is exponential in s. We prove that this simulation is tight. Furthermore, its cost cannot be reduced even if it is performed by a twoway nondeterministic automaton. We also prove that there are unary languages for which deterministic pushdown automata cannot be exponentially more
Modeling and simulation of genetic regulatory systems: A literature review
 JOURNAL OF COMPUTATIONAL BIOLOGY
, 2002
"... In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between ..."
Abstract

Cited by 729 (15 self)
 Add to MetaCart
DNA, RNA, proteins, and small molecules. As most genetic regulatory networks of interest involve many components connected through interlocking positive and negative feedback loops, an intuitive understanding of their dynamics is hard to obtain. As a consequence, formal methods and computer tools
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found
The SPLASH2 programs: Characterization and methodological considerations
 INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE
, 1995
"... The SPLASH2 suite of parallel applications has recently been released to facilitate the study of centralized and distributed sharedaddressspace multiprocessors. In this context, this paper has two goals. One is to quantitatively characterize the SPLASH2 programs in terms of fundamental propertie ..."
Abstract

Cited by 1399 (12 self)
 Add to MetaCart
The SPLASH2 suite of parallel applications has recently been released to facilitate the study of centralized and distributed sharedaddressspace multiprocessors. In this context, this paper has two goals. One is to quantitatively characterize the SPLASH2 programs in terms of fundamental
Results 1  10
of
73,608