7 search results - page 1 / 2 » Finite Automata with Generalized Acceptance Criteria |
55
Voted
ICALP
1999
Springer
15 years 2 months ago
1999
Springer
91
Voted
DLT
2003
14 years 11 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
83
Voted
ATVA
2006
Springer
15 years 2 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
85
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
83
Voted
CAV
2008
Springer
15 years 7 days ago
2008
Springer
Requirements of reactive systems are usually specified by classifying system executions as desirable and undesirable. To specify prioritized requirements, we propose to associate a...