Sciweavers

921 search results - page 10 / 185
» On Interleaving in Timed Automata
Sort
View
LATA
2010
Springer
14 years 4 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
WIA
2000
Springer
13 years 11 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
ECBS
2009
IEEE
113views Hardware» more  ECBS 2009»
14 years 2 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...
FUIN
2008
101views more  FUIN 2008»
13 years 7 months 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...
FUIN
2007
104views more  FUIN 2007»
13 years 7 months 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