Sciweavers

732 search results - page 114 / 147
» Axiomatising timed automata
Sort
View
ALIFE
2004
13 years 7 months ago
Building Artificial Life for Play
Toys and play-things are often engineered to replicate the character of real organisms. In the past, inventors often lavished great expense on their life-like automata, their cons...
Alan Dorin
FSTTCS
2010
Springer
13 years 5 months ago
Model checking time-constrained scenario-based specifications
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
S. Akshay, Paul Gastin, Madhavan Mukund, K. Naraya...
LATA
2009
Springer
14 years 2 months ago
The Fault Tolerance of NP-Hard Problems
We study the effects of faulty data on NP-hard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are...
Christian Glaßer, Aduri Pavan, Stephen D. Tr...
HYBRID
2003
Springer
14 years 25 days 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 22 days 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