Name
Title | ||
|---|---|---|
Adaptive Symbolic Control for Finite-State Transition Systems With Grammatical Inference |
Abstract | ||
|---|---|---|
This note presents an approach that integrates elements from grammatical inference and game theory to address the problem of supervising finite-state transition systems operating in adversarial, partially known, rule-governed environments. The combined formulation produces controllers which guarantee that a transition system satisfies a task specification in the form of a logical formula, if and only 1) the true model of the environment is in the class of models inferable from positive data presentation (observations), 2) a characteristic sample of the environment's behavior is observed, and 3) the task specification is satisfiable given the capabilities described by the abstractions of the system and its environment. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TAC.2013.2272885 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Games,Automata,Grammar,Labeling,Doped fiber amplifiers,Game theory,Context | Transition system,Abstraction,Grammar induction,Task analysis,Computer science,Algorithmic game theory,Theoretical computer science,Game theory,Adaptive control,Adversarial system | Journal |
Volume | Issue | ISSN |
59 | 2 | 0018-9286 |
Citations | PageRank | References |
3 | 0.38 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jie Fu | 1 | 22 | 2.59 |
| Herbert Tanner | 2 | 921 | 91.72 |
| Jeffrey Heinz | 3 | 118 | 19.03 |
| Jane Chandlee | 4 | 20 | 3.56 |