11 search results - page 1 / 3 » Slicing of Timed Automata with Discrete Data |
FUIN
2006
13 years 4 months ago
2006
FUIN
2008
13 years 4 months ago
2008
The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is transla...
16
Voted
FUIN
2007
13 years 4 months ago
2007
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
FUIN
2008
13 years 4 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...
WIA
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...