1650 search results - page 179 / 330 » The HOM problem is decidable |
104
click to vote
FMSD
2008
15 years 4 months ago
2008
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
151
click to vote
IANDC
2008
15 years 4 months ago
2008
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
120
click to vote
CC
2006
Springer
15 years 4 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
126
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...
132
click to vote
DKE
2006
15 years 4 months ago
2006
Inconsistencies frequently occur in news about the real-world. Some of these inconsistencies may be more significant than others, and some news may contain more inconsistencies th...