Sciweavers

201 search results - page 1 / 41
» Reducing the number of clock variables of timed automata
Sort
View
RTSS
1996
IEEE
13 years 9 months ago
Reducing the number of clock variables of timed automata
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
Conrado Daws, Sergio Yovine
FSEN
2007
Springer
13 years 11 months ago
Zone-Based Universality Analysis for Single-Clock Timed Automata
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
Parosh Aziz Abdulla, Joël Ouaknine, Karin Qua...
TSE
2008
97views more  TSE 2008»
13 years 4 months ago
Timed Automata Patterns
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
13 years 6 months ago
Recursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Ashutosh Trivedi, Dominik Wojtczak
ICTAC
2005
Springer
13 years 10 months ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang