921 search results - page 41 / 185 » On Interleaving in Timed Automata |
113
click to vote
HYBRID
2009
Springer
15 years 8 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
118
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
116
click to vote
ACSD
1998
IEEE
15 years 6 months ago
1998
IEEE
One of the central objectives of the LOTOS restandardisation activity is to de ne an enhanced LOTOS language which supports real-time speci cation. The timed extension is based up...
109
click to vote
FOSSACS
2004
Springer
15 years 7 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
116
click to vote
ARTS
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...