5 search results - page 1 / 1 » An Infinite Automaton Characterization of Double Exponential... |
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
FORMATS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Continuous-time Markov decision process are an important variant of labelled transition systems having nondeterminism through labels and stochasticity through exponential...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...
ICDT
2007
ACM
13 years 10 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...