29 search results - page 3 / 6 » Translation of Timed Promela to Timed Automata with Discrete... |
IFM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. To model real-life critical systems, one needs“high-level”languages to express three important concepts: complex data structures, concurrency, and real-time. So far, ...
FM
2001
Springer
14 years 21 hour ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
FUIN
2006
13 years 7 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
MEMOCODE
2003
IEEE
14 years 24 days ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...