Name
Abstract | ||
|---|---|---|
In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The main differences from the usual timed automata are: time elapses on transitions (passing through a state is instantaneous), signals may be split on a run on an automaton and constraints on transitions correspond to unions of open intervals but should be satisfied on closed intervals. This makes exact rendez-vous impossible. The paper stresses on the similarities and differences from the usual model. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ipl.2003.11.010 | Inf. Process. Lett. |
Keywords | Field | DocType |
signal regular expression,open interval,time elapse,main difference,exact rendez-vous,piecewise constant signal,formal languages,closed interval,timed automata,usual model,kleene theorem,splitable signal,formal language,satisfiability,regular expression | Discrete mathematics,Regular expression,Automata theory,Formal language,Information processing,Automaton,Timed automaton,Regular language,Mathematics,Piecewise | Journal |
Volume | Issue | ISSN |
89 | 5 | 0020-0190 |
Citations | PageRank | References |
4 | 0.81 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jérôme Durand-Lose | 1 | 127 | 14.93 |