Sciweavers

1246 search results - page 11 / 250
» Recursive Timed Automata
Sort
View
97
Voted
LATA
2010
Springer
15 years 10 months ago
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
Neda Saeedloei and Gopal Gupta
96
Voted
WIA
2000
Springer
15 years 4 months ago
Generalizing the Discrete Timed Automaton
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
Oscar H. Ibarra, Jianwen Su
107
Voted
ECBS
2009
IEEE
113views Hardware» more  ECBS 2009»
15 years 7 months ago
Modeling and Analysis of Probabilistic Timed Systems
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
Abhishek Dubey, Derek Riley, Sherif Abdelwahed, Te...
103
Voted
FUIN
2008
101views more  FUIN 2008»
15 years 22 days ago
Translation of Intermediate Language to Timed Automata with Discrete Data
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...
Agata Janowska, Pawel Janowski, Dobieslaw Wr&oacut...
105
Voted
FUIN
2007
104views more  FUIN 2007»
15 years 19 days ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
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...
Andrzej Zbrzezny, Agata Pólrola