Sciweavers

1246 search results - page 36 / 250
» Recursive Timed Automata
Sort
View
86
Voted
FMCAD
2006
Springer
15 years 4 months ago
Optimizations for LTL Synthesis
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
Barbara Jobstmann, Roderick Bloem
102
Voted
FORMATS
2006
Springer
15 years 4 months ago
Undecidable Problems About Timed Automata
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
Olivier Finkel
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 5 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
97
Voted
FORMATS
2005
Springer
15 years 6 months ago
Implementation of Timed Automata: An Issue of Semantics or Modeling?
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
Karine Altisen, Stavros Tripakis
91
Voted
FORMATS
2004
Springer
15 years 4 months ago
Decomposing Verification of Timed I/O Automata
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
Dilsun Kirli Kaynar, Nancy A. Lynch