3229 search results - page 79 / 646 » The Theory of Timed Automata |
113
click to vote
IJCAI
2003
15 years 7 months ago
2003
Automated verification is one of the most success ful applications of automated reasoning in com puter science. In automated verification one uses algorithmic techniques to es...
148
click to vote
CAV
2007
Springer
15 years 12 months ago
2007
Springer
In this paper we propose a complete chain for synthesizing controllers from high-level specifications. From real-time properties expressed in the logic MTL we generate, under boun...
135
click to vote
TIME
2002
IEEE
15 years 10 months ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
151
click to vote
CONCUR
2009
Springer
16 years 7 days ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...