1705 search results - page 29 / 341 » Representing Constraints with Automata |
ASYNC
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose a novel technique for modeling and verifying timed circuits based on the notion of generalized relative timing. Generalized relative timing constraints can express not ...
TOSEM
2010
13 years 2 months ago
2010
Web services are increasingly gaining acceptance as a framework for facilitating application-to-application interactions within and across enterprises. It is commonly accepted tha...
FM
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. The design of controllers for hybridsystems i.e. mixeddiscretecontinuous systems in a systematic manner remains a challenging task. In this case study, we apply formal m...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents two novel features of an emergent data visualization method coined "cellular ants": unsupervised data class labeling and shape negotiation. This metho...