Sciweavers

942 search results - page 150 / 189
» Interrupt Timed Automata
Sort
View
HYBRID
2003
Springer
14 years 2 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
LATA
2010
Springer
14 years 1 months ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau
CC
1999
Springer
154views System Software» more  CC 1999»
14 years 1 months ago
Faster Generalized LR Parsing
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
John Aycock, R. Nigel Horspool
FORMATS
2008
Springer
13 years 10 months ago
Convergence Verification: From Shared Memory to Partially Synchronous Systems
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
K. Mani Chandy, Sayan Mitra, Concetta Pilotto
MSV
2004
13 years 10 months ago
Accurate Modeling and Simulation of Heart Tissue with GDEVS/Cell-DEVS
- We present a model describing the electrical behavior of the heart tissue. Previous research in this field have studied this problem using PDEs (Partial Differential Equations) a...
Gabriel A. Wainer, Norbert Giambiasi