Sciweavers

3229 search results - page 3 / 646
» The Theory of Timed Automata
Sort
View
FORMATS
2005
Springer
13 years 11 months ago
Reachability Problems on Extended O-Minimal Hybrid Automata
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
Raffaella Gentilini
FORMATS
2009
Springer
13 years 12 months ago
On the Supports of Recognizable Timed Series
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
Karin Quaas
TPHOL
2008
IEEE
13 years 11 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 3 months ago
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
Karine Altisen, Yanhong Liu, Matthieu Moy
JCSS
2007
107views more  JCSS 2007»
13 years 5 months ago
On the minimization of XML Schemas and tree automata for unranked trees
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
Wim Martens, Joachim Niehren