135 search results - page 7 / 27 » Model Checking Timed Automata with One or Two Clocks |
STACS
2001
Springer
14 years 3 days ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...
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...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
FUIN
2008
13 years 7 months ago
2008
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...