3229 search results - page 46 / 646 » The Theory of Timed Automata |
ARTS
1997
Springer
14 years 27 days ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
FORMATS
2007
Springer
14 years 19 days ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
IPL
2008
13 years 8 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
FCT
2009
Springer
14 years 3 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...