Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

WIA
2000
Springer

favoriteEmaildiscussreport

92views Artificial Intelligence» more WIA 2000»

Generalizing the Discrete Timed Automaton

14 years 2 months ago

Generalizing the Discrete Timed Automaton

Download www.cs.ucsb.edu

Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with various data structures. We give examples of such data structures and exhibit some new properties of discrete timed automata that can be verified. We also briefly consider reachability in discrete timed automata operating in parallel.

Oscar H. Ibarra, Jianwen Su

Real-time Traffic

Artificial Intelligence | Binary Reachability | Data Structures | Discrete Timed Automata | WIA 2000 |

claim paper

Related Content

» Augmenting the discrete timed automaton with other data structures

» On Removing the Pushdown Stack in Reachability Constructions

» Reduction of Timed Hybrid Systems

» On Presburger Liveness of Discrete Timed Automata

» First Steps Towards Incremental Diagnosis of DiscreteEvent Systems

» Weighted Timed MSO Logics

» Binary Reachability Analysis of Discrete Pushdown Timed Automata

» Past Pushdown Timed Automata

» Analyzing a degenerate buffer with general interarrival and service times in discrete time

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	2000
Where	WIA
Authors	Oscar H. Ibarra, Jianwen Su

Comments (0)