101 search results - page 6 / 21 » A New Class of Decidable Hybrid Systems |
HYBRID
2003
Springer
14 years 28 days ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
CIBCB
2006
IEEE
13 years 9 months ago
2006
IEEE
In recent years, unsupervised gene (feature) selection has become an integral part of microarray analysis because of the large number of genes and complexity in biological systems....
KRDB
2003
13 years 9 months ago
2003
We report about some preliminary issues from the DFG project “Description Logics and Spatial Reasoning” (“DLS”, DFG Grant NE 279/8-1), one of whose goals is to develop a p...
CADE
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...