14 search results - page 1 / 3 » Universality and Language Inclusion for Open and Closed Time... |
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
CONCUR
1998
Springer
13 years 9 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...