3229 search results - page 91 / 646 » The Theory of Timed Automata |
129
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform c...
181
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
190
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
162
click to vote
TCS
2002
15 years 6 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
164
click to vote
DLT
2009
15 years 4 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...