1728 search results - page 8 / 346 » The Size of Power Automata |
JACM
2002
13 years 8 months ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
FCT
2005
Springer
14 years 2 months ago
2005
Springer
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
IANDC
2008
13 years 8 months ago
2008
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
LATA
2010
Springer
14 years 5 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...