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...
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...
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...
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). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...