Sciweavers

201 search results - page 2 / 41
» Reducing the number of clock variables of timed automata
Sort
View
IPL
2006
91views more  IPL 2006»
13 years 5 months ago
Improved undecidability results on weighted timed automata
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...
Patricia Bouyer, Thomas Brihaye, Nicolas Markey
CONCUR
1999
Springer
13 years 9 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
ISQED
2005
IEEE
95views Hardware» more  ISQED 2005»
13 years 11 months ago
Statistical Analysis of Clock Skew Variation in H-Tree Structure
This paper discusses clock skew due to manufacturing variability and environmental change. In clock tree design, transition time constraint is an important design parameter that c...
Masanori Hashimoto, Tomonori Yamamoto, Hidetoshi O...
ATVA
2005
Springer
111views Hardware» more  ATVA 2005»
13 years 10 months ago
Model Checking Prioritized Timed Automata
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
Shang-Wei Lin, Pao-Ann Hsiung, Chun-Hsian Huang, Y...
FOSSACS
2009
Springer
14 years 2 days ago
Interrupt Timed Automata
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
Béatrice Bérard, Serge Haddad