732 search results - page 16 / 147 » Axiomatising timed automata |
CAV
2000
Springer
13 years 12 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
ASWEC
2007
IEEE
14 years 1 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
ICALP
2005
Springer
14 years 1 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...
IPL
2006
13 years 7 months ago
2006
In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...