585 search results - page 7 / 117 » Better Abstractions for Timed Automata |
CIE
2005
Springer
14 years 3 months ago
2005
Springer
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
CAV
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
WIA
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. In computer science methods to aid learning are very imporcause abstract models are used frequently. For this conventional teaching methods do not suffice. We have develo...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
FUIN
2007
13 years 9 months ago
2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...